./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.11.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 c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:35:52,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:35:52,064 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:35:52,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:35:52,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:35:52,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:35:52,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:35:52,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:35:52,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:35:52,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:35:52,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:35:52,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:35:52,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:35:52,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:35:52,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:35:52,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:35:52,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:35:52,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:35:52,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:35:52,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:35:52,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:35:52,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:35:52,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:35:52,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:35:52,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:35:52,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:35:52,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:35:52,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:35:52,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:35:52,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:35:52,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:35:52,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:35:52,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:52,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:35:52,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:35:52,101 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:35:52,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:35:52,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:35:52,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:35:52,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:35:52,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:35:52,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:35:52,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:35:52,101 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 -> c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c [2025-03-08 07:35:52,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:35:52,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:35:52,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:35:52,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:35:52,331 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:35:52,332 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.11.cil-2.c [2025-03-08 07:35:53,501 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d91fe44/cea450c4dca546a49a6c04efc27e320d/FLAGec51e93c1 [2025-03-08 07:35:53,884 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:35:53,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c [2025-03-08 07:35:53,901 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d91fe44/cea450c4dca546a49a6c04efc27e320d/FLAGec51e93c1 [2025-03-08 07:35:54,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1d91fe44/cea450c4dca546a49a6c04efc27e320d [2025-03-08 07:35:54,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:35:54,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:35:54,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:54,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:35:54,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:35:54,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581b8629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54, skipping insertion in model container [2025-03-08 07:35:54,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:35:54,249 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.11.cil-2.c[911,924] [2025-03-08 07:35:54,311 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.11.cil-2.c[8416,8429] [2025-03-08 07:35:54,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:54,442 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:35:54,454 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.11.cil-2.c[911,924] [2025-03-08 07:35:54,484 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.11.cil-2.c[8416,8429] [2025-03-08 07:35:54,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:54,593 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:35:54,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54 WrapperNode [2025-03-08 07:35:54,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:54,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:54,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:35:54,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:35:54,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,622 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,657 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 992 [2025-03-08 07:35:54,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:54,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:35:54,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:35:54,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:35:54,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,701 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-08 07:35:54,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,712 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:35:54,720 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:35:54,720 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:35:54,720 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:35:54,721 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (1/1) ... [2025-03-08 07:35:54,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:54,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:35:54,765 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-08 07:35:54,772 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-08 07:35:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:35:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:35:54,799 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:35:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:35:54,799 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:35:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:35:54,799 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:35:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:35:54,799 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:35:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:35:54,799 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:35:54,799 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:35:54,800 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:35:54,800 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:35:54,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:35:54,920 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:35:55,762 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-08 07:35:55,763 INFO L1307 $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-08 07:35:55,763 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-08 07:35:56,046 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-08 07:35:56,046 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:35:56,063 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:35:56,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:35:56,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:56 BoogieIcfgContainer [2025-03-08 07:35:56,064 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:35:56,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:35:56,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:35:56,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:35:56,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:35:54" (1/3) ... [2025-03-08 07:35:56,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c24f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:56, skipping insertion in model container [2025-03-08 07:35:56,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:54" (2/3) ... [2025-03-08 07:35:56,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c24f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:56, skipping insertion in model container [2025-03-08 07:35:56,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:56" (3/3) ... [2025-03-08 07:35:56,073 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-2.c [2025-03-08 07:35:56,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:35:56,090 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.11.cil-2.c that has 15 procedures, 468 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-03-08 07:35:56,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:35:56,161 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;@529384ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:35:56,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:35:56,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 412 states have (on average 1.5922330097087378) internal successors, (656), 416 states have internal predecessors, (656), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 07:35:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:56,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:56,177 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] [2025-03-08 07:35:56,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:56,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash -924940334, now seen corresponding path program 1 times [2025-03-08 07:35:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839863517] [2025-03-08 07:35:56,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:56,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:56,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:56,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:56,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:56,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:56,670 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-08 07:35:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:56,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839863517] [2025-03-08 07:35:56,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839863517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:56,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:56,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494861101] [2025-03-08 07:35:56,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:56,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:56,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:56,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:56,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:56,711 INFO L87 Difference]: Start difference. First operand has 468 states, 412 states have (on average 1.5922330097087378) internal successors, (656), 416 states have internal predecessors, (656), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 07:35:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:57,758 INFO L93 Difference]: Finished difference Result 1024 states and 1609 transitions. [2025-03-08 07:35:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:57,783 INFO L225 Difference]: With dead ends: 1024 [2025-03-08 07:35:57,783 INFO L226 Difference]: Without dead ends: 573 [2025-03-08 07:35:57,789 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-08 07:35:57,792 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 496 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:57,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1493 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:35:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-08 07:35:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 566. [2025-03-08 07:35:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 488 states have (on average 1.5348360655737705) internal successors, (749), 494 states have internal predecessors, (749), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2025-03-08 07:35:57,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 860 transitions. [2025-03-08 07:35:57,869 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 860 transitions. Word has length 63 [2025-03-08 07:35:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:57,870 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 860 transitions. [2025-03-08 07:35:57,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-08 07:35:57,870 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 860 transitions. [2025-03-08 07:35:57,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:57,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:57,873 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] [2025-03-08 07:35:57,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:35:57,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:57,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash 79284018, now seen corresponding path program 1 times [2025-03-08 07:35:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:57,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293772457] [2025-03-08 07:35:57,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:57,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:57,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:57,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:57,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:58,051 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-08 07:35:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293772457] [2025-03-08 07:35:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293772457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:58,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:58,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:58,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801014961] [2025-03-08 07:35:58,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:58,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:58,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:58,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:58,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:58,056 INFO L87 Difference]: Start difference. First operand 566 states and 860 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-08 07:35:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:59,142 INFO L93 Difference]: Finished difference Result 921 states and 1363 transitions. [2025-03-08 07:35:59,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:59,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:59,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:59,146 INFO L225 Difference]: With dead ends: 921 [2025-03-08 07:35:59,146 INFO L226 Difference]: Without dead ends: 720 [2025-03-08 07:35:59,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:59,147 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1026 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:59,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1742 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:35:59,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-08 07:35:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 674. [2025-03-08 07:35:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 574 states have (on average 1.5174216027874565) internal successors, (871), 582 states have internal predecessors, (871), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2025-03-08 07:35:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1016 transitions. [2025-03-08 07:35:59,192 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1016 transitions. Word has length 63 [2025-03-08 07:35:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:59,192 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1016 transitions. [2025-03-08 07:35:59,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-08 07:35:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1016 transitions. [2025-03-08 07:35:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:59,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:59,195 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] [2025-03-08 07:35:59,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:35:59,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:59,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash 71524659, now seen corresponding path program 1 times [2025-03-08 07:35:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658111504] [2025-03-08 07:35:59,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:59,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:59,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:59,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:59,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:59,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:59,322 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-08 07:35:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:59,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658111504] [2025-03-08 07:35:59,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658111504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:59,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:59,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:35:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498859410] [2025-03-08 07:35:59,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:59,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:35:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:59,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:35:59,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:35:59,325 INFO L87 Difference]: Start difference. First operand 674 states and 1016 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:36:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:00,560 INFO L93 Difference]: Finished difference Result 2050 states and 2994 transitions. [2025-03-08 07:36:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:36:00,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 63 [2025-03-08 07:36:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:00,573 INFO L225 Difference]: With dead ends: 2050 [2025-03-08 07:36:00,574 INFO L226 Difference]: Without dead ends: 1729 [2025-03-08 07:36:00,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:36:00,579 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 3179 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3197 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:00,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3197 Valid, 1932 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:36:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-03-08 07:36:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1682. [2025-03-08 07:36:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1377 states have (on average 1.4306463326071168) internal successors, (1970), 1400 states have internal predecessors, (1970), 177 states have call successors, (177), 111 states have call predecessors, (177), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2025-03-08 07:36:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2358 transitions. [2025-03-08 07:36:00,795 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2358 transitions. Word has length 63 [2025-03-08 07:36:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:00,795 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2358 transitions. [2025-03-08 07:36:00,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:36:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2358 transitions. [2025-03-08 07:36:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:36:00,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:00,797 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] [2025-03-08 07:36:00,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:36:00,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:00,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:00,798 INFO L85 PathProgramCache]: Analyzing trace with hash -506849941, now seen corresponding path program 1 times [2025-03-08 07:36:00,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:00,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267256842] [2025-03-08 07:36:00,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:00,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:36:00,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:36:00,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:00,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:00,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:00,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267256842] [2025-03-08 07:36:00,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267256842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:00,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:00,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070087215] [2025-03-08 07:36:00,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:00,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:00,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:00,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:00,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:00,933 INFO L87 Difference]: Start difference. First operand 1682 states and 2358 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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-08 07:36:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:01,065 INFO L93 Difference]: Finished difference Result 3045 states and 4226 transitions. [2025-03-08 07:36:01,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:36:01,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2025-03-08 07:36:01,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:01,073 INFO L225 Difference]: With dead ends: 3045 [2025-03-08 07:36:01,073 INFO L226 Difference]: Without dead ends: 1722 [2025-03-08 07:36:01,077 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-08 07:36:01,077 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 0 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3509 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-08 07:36:01,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3509 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-03-08 07:36:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2025-03-08 07:36:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1722 states, 1409 states have (on average 1.4166075230660042) internal successors, (1996), 1432 states have internal predecessors, (1996), 177 states have call successors, (177), 111 states have call predecessors, (177), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2025-03-08 07:36:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2392 transitions. [2025-03-08 07:36:01,173 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2392 transitions. Word has length 64 [2025-03-08 07:36:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:01,174 INFO L471 AbstractCegarLoop]: Abstraction has 1722 states and 2392 transitions. [2025-03-08 07:36:01,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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-08 07:36:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2392 transitions. [2025-03-08 07:36:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:36:01,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:01,176 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] [2025-03-08 07:36:01,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:36:01,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:01,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1443450314, now seen corresponding path program 1 times [2025-03-08 07:36:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906476333] [2025-03-08 07:36:01,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:01,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:36:01,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:36:01,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:01,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:01,275 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-08 07:36:01,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906476333] [2025-03-08 07:36:01,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906476333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:01,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:36:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661488662] [2025-03-08 07:36:01,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:01,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:36:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:01,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:36:01,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:36:01,277 INFO L87 Difference]: Start difference. First operand 1722 states and 2392 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:36:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:02,502 INFO L93 Difference]: Finished difference Result 4941 states and 6809 transitions. [2025-03-08 07:36:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:36:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-03-08 07:36:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:02,515 INFO L225 Difference]: With dead ends: 4941 [2025-03-08 07:36:02,516 INFO L226 Difference]: Without dead ends: 2010 [2025-03-08 07:36:02,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:36:02,524 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 3208 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3226 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:02,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3226 Valid, 1973 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:36:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2025-03-08 07:36:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1940. [2025-03-08 07:36:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1555 states have (on average 1.3691318327974276) internal successors, (2129), 1580 states have internal predecessors, (2129), 217 states have call successors, (217), 139 states have call predecessors, (217), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2025-03-08 07:36:02,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 2611 transitions. [2025-03-08 07:36:02,623 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 2611 transitions. Word has length 64 [2025-03-08 07:36:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:02,623 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 2611 transitions. [2025-03-08 07:36:02,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:36:02,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 2611 transitions. [2025-03-08 07:36:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:02,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:02,624 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:02,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:36:02,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:02,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:02,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1456334414, now seen corresponding path program 1 times [2025-03-08 07:36:02,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:02,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312234271] [2025-03-08 07:36:02,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:02,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:02,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:02,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:02,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:02,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:36:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:02,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312234271] [2025-03-08 07:36:02,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312234271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:02,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:02,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:02,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408277282] [2025-03-08 07:36:02,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:02,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:02,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:02,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:02,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:02,707 INFO L87 Difference]: Start difference. First operand 1940 states and 2611 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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-08 07:36:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:02,803 INFO L93 Difference]: Finished difference Result 3581 states and 4764 transitions. [2025-03-08 07:36:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:36:02,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 86 [2025-03-08 07:36:02,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:02,815 INFO L225 Difference]: With dead ends: 3581 [2025-03-08 07:36:02,816 INFO L226 Difference]: Without dead ends: 2000 [2025-03-08 07:36:02,821 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-08 07:36:02,822 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 0 mSDsluCounter, 2775 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3470 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:02,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3470 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2025-03-08 07:36:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 2000. [2025-03-08 07:36:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1603 states have (on average 1.3543356207111665) internal successors, (2171), 1628 states have internal predecessors, (2171), 217 states have call successors, (217), 139 states have call predecessors, (217), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2025-03-08 07:36:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2665 transitions. [2025-03-08 07:36:02,903 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2665 transitions. Word has length 86 [2025-03-08 07:36:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:02,904 INFO L471 AbstractCegarLoop]: Abstraction has 2000 states and 2665 transitions. [2025-03-08 07:36:02,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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-08 07:36:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2665 transitions. [2025-03-08 07:36:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:02,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:02,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:02,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:36:02,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:02,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash -486753391, now seen corresponding path program 1 times [2025-03-08 07:36:02,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:02,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311547731] [2025-03-08 07:36:02,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:02,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:02,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:02,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:02,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:02,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:36:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:03,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311547731] [2025-03-08 07:36:03,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311547731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:03,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016147399] [2025-03-08 07:36:03,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:03,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:03,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:03,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:03,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:03,048 INFO L87 Difference]: Start difference. First operand 2000 states and 2665 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-08 07:36:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:03,812 INFO L93 Difference]: Finished difference Result 3406 states and 4462 transitions. [2025-03-08 07:36:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:36:03,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 86 [2025-03-08 07:36:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:03,824 INFO L225 Difference]: With dead ends: 3406 [2025-03-08 07:36:03,824 INFO L226 Difference]: Without dead ends: 1996 [2025-03-08 07:36:03,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:03,829 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 1027 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:03,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 1519 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-03-08 07:36:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1786. [2025-03-08 07:36:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1442 states have (on average 1.3592233009708738) internal successors, (1960), 1462 states have internal predecessors, (1960), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2025-03-08 07:36:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2386 transitions. [2025-03-08 07:36:03,944 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2386 transitions. Word has length 86 [2025-03-08 07:36:03,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:03,945 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 2386 transitions. [2025-03-08 07:36:03,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-08 07:36:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2386 transitions. [2025-03-08 07:36:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:03,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:03,947 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:03,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:36:03,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:03,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash -935450030, now seen corresponding path program 1 times [2025-03-08 07:36:03,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:03,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731438747] [2025-03-08 07:36:03,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:03,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:03,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:03,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:03,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:36:04,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:04,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731438747] [2025-03-08 07:36:04,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731438747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:04,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:04,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:36:04,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088686783] [2025-03-08 07:36:04,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:04,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:36:04,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:04,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:36:04,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:36:04,024 INFO L87 Difference]: Start difference. First operand 1786 states and 2386 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:36:04,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:04,524 INFO L93 Difference]: Finished difference Result 4638 states and 6116 transitions. [2025-03-08 07:36:04,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:36:04,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2025-03-08 07:36:04,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:04,570 INFO L225 Difference]: With dead ends: 4638 [2025-03-08 07:36:04,571 INFO L226 Difference]: Without dead ends: 3212 [2025-03-08 07:36:04,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:04,574 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 958 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:04,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 766 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:36:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2025-03-08 07:36:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2025-03-08 07:36:04,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2548 states have (on average 1.3127943485086342) internal successors, (3345), 2597 states have internal predecessors, (3345), 350 states have call successors, (350), 233 states have call predecessors, (350), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2025-03-08 07:36:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 4215 transitions. [2025-03-08 07:36:04,716 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 4215 transitions. Word has length 86 [2025-03-08 07:36:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:04,717 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 4215 transitions. [2025-03-08 07:36:04,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:36:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 4215 transitions. [2025-03-08 07:36:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:04,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:04,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:04,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:36:04,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:04,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 173365169, now seen corresponding path program 1 times [2025-03-08 07:36:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664358192] [2025-03-08 07:36:04,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:04,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:04,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:04,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:04,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:36:04,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:04,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664358192] [2025-03-08 07:36:04,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664358192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:04,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:04,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:36:04,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230860473] [2025-03-08 07:36:04,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:04,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:36:04,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:04,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:36:04,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:36:04,758 INFO L87 Difference]: Start difference. First operand 3212 states and 4215 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:04,849 INFO L93 Difference]: Finished difference Result 4638 states and 5996 transitions. [2025-03-08 07:36:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:36:04,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2025-03-08 07:36:04,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:04,858 INFO L225 Difference]: With dead ends: 4638 [2025-03-08 07:36:04,859 INFO L226 Difference]: Without dead ends: 1786 [2025-03-08 07:36:04,863 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-08 07:36:04,866 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 137 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1246 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-08 07:36:04,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1246 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:04,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2025-03-08 07:36:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1786. [2025-03-08 07:36:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1442 states have (on average 1.3335644937586686) internal successors, (1923), 1462 states have internal predecessors, (1923), 189 states have call successors, (189), 120 states have call predecessors, (189), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2025-03-08 07:36:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2349 transitions. [2025-03-08 07:36:04,939 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2349 transitions. Word has length 86 [2025-03-08 07:36:04,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:04,940 INFO L471 AbstractCegarLoop]: Abstraction has 1786 states and 2349 transitions. [2025-03-08 07:36:04,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2349 transitions. [2025-03-08 07:36:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 07:36:04,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:04,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:04,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:36:04,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:04,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:04,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2129831743, now seen corresponding path program 1 times [2025-03-08 07:36:04,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:04,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736261233] [2025-03-08 07:36:04,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:04,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:04,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:36:04,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:36:04,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:04,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:36:05,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:05,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736261233] [2025-03-08 07:36:05,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736261233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:05,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:05,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:36:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023818725] [2025-03-08 07:36:05,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:05,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:36:05,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:05,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:36:05,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:36:05,021 INFO L87 Difference]: Start difference. First operand 1786 states and 2349 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:36:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:06,111 INFO L93 Difference]: Finished difference Result 4071 states and 5266 transitions. [2025-03-08 07:36:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:36:06,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-08 07:36:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:06,124 INFO L225 Difference]: With dead ends: 4071 [2025-03-08 07:36:06,124 INFO L226 Difference]: Without dead ends: 2498 [2025-03-08 07:36:06,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:36:06,129 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 1668 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:06,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 2010 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:36:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2025-03-08 07:36:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2377. [2025-03-08 07:36:06,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 1887 states have (on average 1.2941176470588236) internal successors, (2442), 1916 states have internal predecessors, (2442), 260 states have call successors, (260), 170 states have call predecessors, (260), 228 states have return successors, (342), 292 states have call predecessors, (342), 258 states have call successors, (342) [2025-03-08 07:36:06,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3044 transitions. [2025-03-08 07:36:06,261 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3044 transitions. Word has length 87 [2025-03-08 07:36:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:06,261 INFO L471 AbstractCegarLoop]: Abstraction has 2377 states and 3044 transitions. [2025-03-08 07:36:06,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:36:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3044 transitions. [2025-03-08 07:36:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 07:36:06,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:06,265 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:06,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:36:06,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:06,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1553461271, now seen corresponding path program 1 times [2025-03-08 07:36:06,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:06,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348322833] [2025-03-08 07:36:06,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:06,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:06,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 07:36:06,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 07:36:06,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:06,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 07:36:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348322833] [2025-03-08 07:36:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348322833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:36:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130331856] [2025-03-08 07:36:06,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:06,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:36:06,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:36:06,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:36:06,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:36:06,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 07:36:06,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 07:36:06,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:06,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:06,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:36:06,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:36:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 07:36:06,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:36:06,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130331856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:06,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:36:06,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:36:06,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000355692] [2025-03-08 07:36:06,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:06,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:36:06,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:06,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:36:06,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:06,733 INFO L87 Difference]: Start difference. First operand 2377 states and 3044 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:36:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:06,980 INFO L93 Difference]: Finished difference Result 6190 states and 7725 transitions. [2025-03-08 07:36:06,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:36:06,980 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 156 [2025-03-08 07:36:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:06,999 INFO L225 Difference]: With dead ends: 6190 [2025-03-08 07:36:06,999 INFO L226 Difference]: Without dead ends: 4246 [2025-03-08 07:36:07,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:07,005 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 61 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:07,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1370 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4246 states. [2025-03-08 07:36:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4246 to 4214. [2025-03-08 07:36:07,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4214 states, 3307 states have (on average 1.258844874508618) internal successors, (4163), 3361 states have internal predecessors, (4163), 467 states have call successors, (467), 333 states have call predecessors, (467), 438 states have return successors, (605), 521 states have call predecessors, (605), 465 states have call successors, (605) [2025-03-08 07:36:07,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4214 states to 4214 states and 5235 transitions. [2025-03-08 07:36:07,295 INFO L78 Accepts]: Start accepts. Automaton has 4214 states and 5235 transitions. Word has length 156 [2025-03-08 07:36:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:07,296 INFO L471 AbstractCegarLoop]: Abstraction has 4214 states and 5235 transitions. [2025-03-08 07:36:07,296 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:36:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4214 states and 5235 transitions. [2025-03-08 07:36:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:07,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:07,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:07,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:36:07,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 07:36:07,503 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:07,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1617508353, now seen corresponding path program 1 times [2025-03-08 07:36:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826670748] [2025-03-08 07:36:07,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:07,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:07,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:07,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:07,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:07,616 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-08 07:36:07,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:07,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826670748] [2025-03-08 07:36:07,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826670748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:07,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:07,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:07,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925005220] [2025-03-08 07:36:07,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:07,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:07,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:07,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:07,617 INFO L87 Difference]: Start difference. First operand 4214 states and 5235 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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-08 07:36:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:08,427 INFO L93 Difference]: Finished difference Result 4920 states and 6363 transitions. [2025-03-08 07:36:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:36:08,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:08,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:08,447 INFO L225 Difference]: With dead ends: 4920 [2025-03-08 07:36:08,447 INFO L226 Difference]: Without dead ends: 4589 [2025-03-08 07:36:08,450 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-08 07:36:08,451 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 1245 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:08,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1844 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2025-03-08 07:36:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 4562. [2025-03-08 07:36:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4562 states, 3628 states have (on average 1.288864388092613) internal successors, (4676), 3683 states have internal predecessors, (4676), 487 states have call successors, (487), 339 states have call predecessors, (487), 445 states have return successors, (626), 541 states have call predecessors, (626), 485 states have call successors, (626) [2025-03-08 07:36:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4562 states to 4562 states and 5789 transitions. [2025-03-08 07:36:08,670 INFO L78 Accepts]: Start accepts. Automaton has 4562 states and 5789 transitions. Word has length 165 [2025-03-08 07:36:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:08,670 INFO L471 AbstractCegarLoop]: Abstraction has 4562 states and 5789 transitions. [2025-03-08 07:36:08,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 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-08 07:36:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4562 states and 5789 transitions. [2025-03-08 07:36:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:08,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:08,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:08,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:36:08,674 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:08,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:08,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2042608963, now seen corresponding path program 1 times [2025-03-08 07:36:08,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:08,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786590585] [2025-03-08 07:36:08,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:08,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:08,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:08,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:08,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:08,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:08,815 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-08 07:36:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786590585] [2025-03-08 07:36:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786590585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:08,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:08,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27302957] [2025-03-08 07:36:08,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:08,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:08,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:08,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:08,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:08,817 INFO L87 Difference]: Start difference. First operand 4562 states and 5789 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:09,750 INFO L93 Difference]: Finished difference Result 5687 states and 7604 transitions. [2025-03-08 07:36:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:09,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:09,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:09,766 INFO L225 Difference]: With dead ends: 5687 [2025-03-08 07:36:09,767 INFO L226 Difference]: Without dead ends: 5008 [2025-03-08 07:36:09,770 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-08 07:36:09,770 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 1253 mSDsluCounter, 2376 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 3167 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:09,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 3167 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5008 states. [2025-03-08 07:36:09,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5008 to 4885. [2025-03-08 07:36:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4885 states, 3924 states have (on average 1.3096330275229358) internal successors, (5139), 3980 states have internal predecessors, (5139), 507 states have call successors, (507), 345 states have call predecessors, (507), 452 states have return successors, (649), 562 states have call predecessors, (649), 505 states have call successors, (649) [2025-03-08 07:36:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4885 states to 4885 states and 6295 transitions. [2025-03-08 07:36:10,017 INFO L78 Accepts]: Start accepts. Automaton has 4885 states and 6295 transitions. Word has length 165 [2025-03-08 07:36:10,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:10,017 INFO L471 AbstractCegarLoop]: Abstraction has 4885 states and 6295 transitions. [2025-03-08 07:36:10,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:10,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4885 states and 6295 transitions. [2025-03-08 07:36:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:10,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:10,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:10,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:36:10,020 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:10,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash -375089438, now seen corresponding path program 1 times [2025-03-08 07:36:10,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:10,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434263310] [2025-03-08 07:36:10,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:10,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:10,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:10,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:10,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:10,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:10,142 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-08 07:36:10,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:10,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434263310] [2025-03-08 07:36:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434263310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:10,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306926178] [2025-03-08 07:36:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:10,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:10,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:10,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:10,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:10,144 INFO L87 Difference]: Start difference. First operand 4885 states and 6295 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:11,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:11,031 INFO L93 Difference]: Finished difference Result 6720 states and 9249 transitions. [2025-03-08 07:36:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:11,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:11,054 INFO L225 Difference]: With dead ends: 6720 [2025-03-08 07:36:11,055 INFO L226 Difference]: Without dead ends: 5718 [2025-03-08 07:36:11,059 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-08 07:36:11,059 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 1248 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:11,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 3151 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5718 states. [2025-03-08 07:36:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5718 to 5576. [2025-03-08 07:36:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5576 states, 4559 states have (on average 1.3485413467865761) internal successors, (6148), 4619 states have internal predecessors, (6148), 547 states have call successors, (547), 357 states have call predecessors, (547), 468 states have return successors, (701), 604 states have call predecessors, (701), 545 states have call successors, (701) [2025-03-08 07:36:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5576 states to 5576 states and 7396 transitions. [2025-03-08 07:36:11,325 INFO L78 Accepts]: Start accepts. Automaton has 5576 states and 7396 transitions. Word has length 165 [2025-03-08 07:36:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:11,326 INFO L471 AbstractCegarLoop]: Abstraction has 5576 states and 7396 transitions. [2025-03-08 07:36:11,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 5576 states and 7396 transitions. [2025-03-08 07:36:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:11,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:11,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:11,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:36:11,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:11,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash -453079709, now seen corresponding path program 1 times [2025-03-08 07:36:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434912463] [2025-03-08 07:36:11,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:11,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:11,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:11,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:11,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:11,505 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-08 07:36:11,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:11,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434912463] [2025-03-08 07:36:11,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434912463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:11,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:11,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:11,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307600352] [2025-03-08 07:36:11,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:11,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:11,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:11,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:11,508 INFO L87 Difference]: Start difference. First operand 5576 states and 7396 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:12,597 INFO L93 Difference]: Finished difference Result 8961 states and 12892 transitions. [2025-03-08 07:36:12,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:12,626 INFO L225 Difference]: With dead ends: 8961 [2025-03-08 07:36:12,626 INFO L226 Difference]: Without dead ends: 7268 [2025-03-08 07:36:12,633 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-08 07:36:12,634 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1243 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:12,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 3139 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:12,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7268 states. [2025-03-08 07:36:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7268 to 7087. [2025-03-08 07:36:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7087 states, 5952 states have (on average 1.4119623655913978) internal successors, (8404), 6026 states have internal predecessors, (8404), 627 states have call successors, (627), 381 states have call predecessors, (627), 506 states have return successors, (829), 688 states have call predecessors, (829), 625 states have call successors, (829) [2025-03-08 07:36:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7087 states to 7087 states and 9860 transitions. [2025-03-08 07:36:12,950 INFO L78 Accepts]: Start accepts. Automaton has 7087 states and 9860 transitions. Word has length 165 [2025-03-08 07:36:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:12,952 INFO L471 AbstractCegarLoop]: Abstraction has 7087 states and 9860 transitions. [2025-03-08 07:36:12,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7087 states and 9860 transitions. [2025-03-08 07:36:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:12,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:12,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:12,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:36:12,956 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:12,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1899709122, now seen corresponding path program 1 times [2025-03-08 07:36:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431300414] [2025-03-08 07:36:12,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:12,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:12,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:12,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:12,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:12,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:13,065 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-08 07:36:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431300414] [2025-03-08 07:36:13,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431300414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:13,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:13,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:13,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341314150] [2025-03-08 07:36:13,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:13,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:13,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:13,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:13,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:13,067 INFO L87 Difference]: Start difference. First operand 7087 states and 9860 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:14,041 INFO L93 Difference]: Finished difference Result 13940 states and 21214 transitions. [2025-03-08 07:36:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:14,075 INFO L225 Difference]: With dead ends: 13940 [2025-03-08 07:36:14,075 INFO L226 Difference]: Without dead ends: 10736 [2025-03-08 07:36:14,084 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-08 07:36:14,084 INFO L435 NwaCegarLoop]: 781 mSDtfsCounter, 1238 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:14,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 3127 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10736 states. [2025-03-08 07:36:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10736 to 10478. [2025-03-08 07:36:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10478 states, 9089 states have (on average 1.4958741335680492) internal successors, (13596), 9209 states have internal predecessors, (13596), 787 states have call successors, (787), 429 states have call predecessors, (787), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-08 07:36:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10478 states to 10478 states and 15564 transitions. [2025-03-08 07:36:14,614 INFO L78 Accepts]: Start accepts. Automaton has 10478 states and 15564 transitions. Word has length 165 [2025-03-08 07:36:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:14,614 INFO L471 AbstractCegarLoop]: Abstraction has 10478 states and 15564 transitions. [2025-03-08 07:36:14,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10478 states and 15564 transitions. [2025-03-08 07:36:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:14,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:14,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:14,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:36:14,620 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:14,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1005774211, now seen corresponding path program 1 times [2025-03-08 07:36:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:14,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543712894] [2025-03-08 07:36:14,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:14,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:14,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:14,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:14,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:14,738 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-08 07:36:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543712894] [2025-03-08 07:36:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543712894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:14,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:14,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:14,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825433232] [2025-03-08 07:36:14,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:14,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:14,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:14,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:14,740 INFO L87 Difference]: Start difference. First operand 10478 states and 15564 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:15,673 INFO L93 Difference]: Finished difference Result 18733 states and 29775 transitions. [2025-03-08 07:36:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:15,761 INFO L225 Difference]: With dead ends: 18733 [2025-03-08 07:36:15,761 INFO L226 Difference]: Without dead ends: 12138 [2025-03-08 07:36:15,772 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-08 07:36:15,773 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 929 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:15,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 1267 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:36:15,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12138 states. [2025-03-08 07:36:16,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12138 to 10478. [2025-03-08 07:36:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10478 states, 9089 states have (on average 1.4940037407855649) internal successors, (13579), 9209 states have internal predecessors, (13579), 787 states have call successors, (787), 429 states have call predecessors, (787), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-08 07:36:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10478 states to 10478 states and 15547 transitions. [2025-03-08 07:36:16,179 INFO L78 Accepts]: Start accepts. Automaton has 10478 states and 15547 transitions. Word has length 165 [2025-03-08 07:36:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:16,179 INFO L471 AbstractCegarLoop]: Abstraction has 10478 states and 15547 transitions. [2025-03-08 07:36:16,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 10478 states and 15547 transitions. [2025-03-08 07:36:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:16,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:16,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:16,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:36:16,184 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:16,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2085316258, now seen corresponding path program 1 times [2025-03-08 07:36:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:16,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575027399] [2025-03-08 07:36:16,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:16,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:16,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:16,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:16,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:16,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:16,258 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-08 07:36:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575027399] [2025-03-08 07:36:16,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575027399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:16,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:16,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:16,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951535354] [2025-03-08 07:36:16,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:16,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:16,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:16,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:16,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:16,261 INFO L87 Difference]: Start difference. First operand 10478 states and 15547 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:17,015 INFO L93 Difference]: Finished difference Result 18650 states and 29575 transitions. [2025-03-08 07:36:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:17,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:17,054 INFO L225 Difference]: With dead ends: 18650 [2025-03-08 07:36:17,054 INFO L226 Difference]: Without dead ends: 12055 [2025-03-08 07:36:17,072 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-08 07:36:17,072 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 926 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:17,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1259 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:36:17,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12055 states. [2025-03-08 07:36:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12055 to 10478. [2025-03-08 07:36:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10478 states, 9089 states have (on average 1.4921333480030807) internal successors, (13562), 9209 states have internal predecessors, (13562), 787 states have call successors, (787), 429 states have call predecessors, (787), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-08 07:36:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10478 states to 10478 states and 15530 transitions. [2025-03-08 07:36:17,555 INFO L78 Accepts]: Start accepts. Automaton has 10478 states and 15530 transitions. Word has length 165 [2025-03-08 07:36:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:17,556 INFO L471 AbstractCegarLoop]: Abstraction has 10478 states and 15530 transitions. [2025-03-08 07:36:17,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 10478 states and 15530 transitions. [2025-03-08 07:36:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:17,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:17,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:17,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:36:17,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:17,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:17,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2120140195, now seen corresponding path program 1 times [2025-03-08 07:36:17,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:17,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225919179] [2025-03-08 07:36:17,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:17,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:17,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:17,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:17,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:17,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:17,637 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-08 07:36:17,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:17,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225919179] [2025-03-08 07:36:17,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225919179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:17,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:17,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:17,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415541790] [2025-03-08 07:36:17,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:17,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:17,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:17,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:17,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:17,639 INFO L87 Difference]: Start difference. First operand 10478 states and 15530 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:18,740 INFO L93 Difference]: Finished difference Result 18567 states and 29375 transitions. [2025-03-08 07:36:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:18,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:18,779 INFO L225 Difference]: With dead ends: 18567 [2025-03-08 07:36:18,780 INFO L226 Difference]: Without dead ends: 11972 [2025-03-08 07:36:18,796 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-08 07:36:18,797 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 923 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:18,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 1251 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:36:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11972 states. [2025-03-08 07:36:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11972 to 10478. [2025-03-08 07:36:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10478 states, 9089 states have (on average 1.4902629552205964) internal successors, (13545), 9209 states have internal predecessors, (13545), 787 states have call successors, (787), 429 states have call predecessors, (787), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-08 07:36:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10478 states to 10478 states and 15513 transitions. [2025-03-08 07:36:19,444 INFO L78 Accepts]: Start accepts. Automaton has 10478 states and 15513 transitions. Word has length 165 [2025-03-08 07:36:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:19,444 INFO L471 AbstractCegarLoop]: Abstraction has 10478 states and 15513 transitions. [2025-03-08 07:36:19,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10478 states and 15513 transitions. [2025-03-08 07:36:19,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:19,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:19,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:19,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:36:19,449 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:19,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 181600898, now seen corresponding path program 1 times [2025-03-08 07:36:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:19,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169586122] [2025-03-08 07:36:19,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:19,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:19,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:19,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:19,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:19,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:19,629 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-08 07:36:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169586122] [2025-03-08 07:36:19,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169586122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:19,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:19,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:19,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562696203] [2025-03-08 07:36:19,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:19,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:19,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:19,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:19,631 INFO L87 Difference]: Start difference. First operand 10478 states and 15513 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:20,891 INFO L93 Difference]: Finished difference Result 25015 states and 40191 transitions. [2025-03-08 07:36:20,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:20,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:20,942 INFO L225 Difference]: With dead ends: 25015 [2025-03-08 07:36:20,942 INFO L226 Difference]: Without dead ends: 18420 [2025-03-08 07:36:20,962 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-08 07:36:20,963 INFO L435 NwaCegarLoop]: 763 mSDtfsCounter, 1209 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:20,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 3058 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18420 states. [2025-03-08 07:36:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18420 to 18070. [2025-03-08 07:36:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18070 states, 16119 states have (on average 1.571499472672002) internal successors, (25331), 16385 states have internal predecessors, (25331), 1107 states have call successors, (1107), 525 states have call predecessors, (1107), 842 states have return successors, (2269), 1192 states have call predecessors, (2269), 1105 states have call successors, (2269) [2025-03-08 07:36:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18070 states to 18070 states and 28707 transitions. [2025-03-08 07:36:21,706 INFO L78 Accepts]: Start accepts. Automaton has 18070 states and 28707 transitions. Word has length 165 [2025-03-08 07:36:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:21,706 INFO L471 AbstractCegarLoop]: Abstraction has 18070 states and 28707 transitions. [2025-03-08 07:36:21,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18070 states and 28707 transitions. [2025-03-08 07:36:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:21,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:21,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:21,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:36:21,714 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:21,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1266405949, now seen corresponding path program 1 times [2025-03-08 07:36:21,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:21,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744358241] [2025-03-08 07:36:21,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:21,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:21,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:21,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:21,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:21,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:21,789 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-08 07:36:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744358241] [2025-03-08 07:36:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744358241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:21,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:21,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:21,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076071486] [2025-03-08 07:36:21,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:21,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:21,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:21,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:21,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:21,791 INFO L87 Difference]: Start difference. First operand 18070 states and 28707 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:22,914 INFO L93 Difference]: Finished difference Result 36177 states and 60895 transitions. [2025-03-08 07:36:22,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:22,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:22,977 INFO L225 Difference]: With dead ends: 36177 [2025-03-08 07:36:22,977 INFO L226 Difference]: Without dead ends: 21990 [2025-03-08 07:36:23,011 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-08 07:36:23,012 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 919 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:23,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 1237 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:36:23,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21990 states. [2025-03-08 07:36:24,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21990 to 18070. [2025-03-08 07:36:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18070 states, 16119 states have (on average 1.5694521992679447) internal successors, (25298), 16385 states have internal predecessors, (25298), 1107 states have call successors, (1107), 525 states have call predecessors, (1107), 842 states have return successors, (2269), 1192 states have call predecessors, (2269), 1105 states have call successors, (2269) [2025-03-08 07:36:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18070 states to 18070 states and 28674 transitions. [2025-03-08 07:36:24,316 INFO L78 Accepts]: Start accepts. Automaton has 18070 states and 28674 transitions. Word has length 165 [2025-03-08 07:36:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:24,316 INFO L471 AbstractCegarLoop]: Abstraction has 18070 states and 28674 transitions. [2025-03-08 07:36:24,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 18070 states and 28674 transitions. [2025-03-08 07:36:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:24,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:24,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:24,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:36:24,323 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:24,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash 72357474, now seen corresponding path program 1 times [2025-03-08 07:36:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531494654] [2025-03-08 07:36:24,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:24,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:24,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:24,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:24,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:24,443 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-08 07:36:24,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:24,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531494654] [2025-03-08 07:36:24,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531494654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:24,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021971358] [2025-03-08 07:36:24,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:24,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:24,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:24,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:24,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:24,445 INFO L87 Difference]: Start difference. First operand 18070 states and 28674 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:26,211 INFO L93 Difference]: Finished difference Result 50261 states and 85648 transitions. [2025-03-08 07:36:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:26,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:26,328 INFO L225 Difference]: With dead ends: 50261 [2025-03-08 07:36:26,328 INFO L226 Difference]: Without dead ends: 36074 [2025-03-08 07:36:26,370 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-08 07:36:26,374 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 1196 mSDsluCounter, 2272 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 3027 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:26,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 3027 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36074 states. [2025-03-08 07:36:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36074 to 35522. [2025-03-08 07:36:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35522 states, 32285 states have (on average 1.637664550100666) internal successors, (52872), 33005 states have internal predecessors, (52872), 1747 states have call successors, (1747), 717 states have call predecessors, (1747), 1488 states have return successors, (5981), 1864 states have call predecessors, (5981), 1745 states have call successors, (5981) [2025-03-08 07:36:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35522 states to 35522 states and 60600 transitions. [2025-03-08 07:36:27,777 INFO L78 Accepts]: Start accepts. Automaton has 35522 states and 60600 transitions. Word has length 165 [2025-03-08 07:36:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:27,777 INFO L471 AbstractCegarLoop]: Abstraction has 35522 states and 60600 transitions. [2025-03-08 07:36:27,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 35522 states and 60600 transitions. [2025-03-08 07:36:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:27,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 07:36:27,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:36:27,786 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash 254090723, now seen corresponding path program 1 times [2025-03-08 07:36:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:27,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549148293] [2025-03-08 07:36:27,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:27,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:27,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:27,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:27,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:27,860 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-08 07:36:27,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:27,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549148293] [2025-03-08 07:36:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549148293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:27,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:27,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240561625] [2025-03-08 07:36:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:27,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:27,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:27,861 INFO L87 Difference]: Start difference. First operand 35522 states and 60600 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:31,616 INFO L93 Difference]: Finished difference Result 109591 states and 200028 transitions. [2025-03-08 07:36:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:31,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:31,940 INFO L225 Difference]: With dead ends: 109591 [2025-03-08 07:36:31,940 INFO L226 Difference]: Without dead ends: 77952 [2025-03-08 07:36:32,034 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-08 07:36:32,035 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1191 mSDsluCounter, 2263 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 3015 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:32,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 3015 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77952 states. [2025-03-08 07:36:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77952 to 76987. [2025-03-08 07:36:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76987 states, 70692 states have (on average 1.6925819046002377) internal successors, (119652), 72806 states have internal predecessors, (119652), 3027 states have call successors, (3027), 1101 states have call predecessors, (3027), 3266 states have return successors, (19549), 3208 states have call predecessors, (19549), 3025 states have call successors, (19549) [2025-03-08 07:36:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76987 states to 76987 states and 142228 transitions. [2025-03-08 07:36:35,485 INFO L78 Accepts]: Start accepts. Automaton has 76987 states and 142228 transitions. Word has length 165 [2025-03-08 07:36:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:35,485 INFO L471 AbstractCegarLoop]: Abstraction has 76987 states and 142228 transitions. [2025-03-08 07:36:35,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 76987 states and 142228 transitions. [2025-03-08 07:36:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-08 07:36:35,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:35,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:35,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:36:35,501 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:35,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash 398500418, now seen corresponding path program 1 times [2025-03-08 07:36:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835531181] [2025-03-08 07:36:35,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:35,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-08 07:36:35,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-08 07:36:35,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:35,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:35,576 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-08 07:36:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:35,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835531181] [2025-03-08 07:36:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835531181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:35,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338915957] [2025-03-08 07:36:35,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:35,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:35,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:35,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:35,578 INFO L87 Difference]: Start difference. First operand 76987 states and 142228 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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-08 07:36:43,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:43,422 INFO L93 Difference]: Finished difference Result 263472 states and 519159 transitions. [2025-03-08 07:36:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:43,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 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 165 [2025-03-08 07:36:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:44,420 INFO L225 Difference]: With dead ends: 263472 [2025-03-08 07:36:44,420 INFO L226 Difference]: Without dead ends: 190368 [2025-03-08 07:36:44,864 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-08 07:36:44,864 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 1530 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:44,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 2990 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190368 states.