./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/transmitter.15.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05397c7941b2acd95b1b6d02c6c64b476ab8b290a5b56301ff8db7ca1986067b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:13:54,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:13:54,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:13:54,898 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:13:54,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:13:54,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:13:54,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:13:54,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:13:54,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:13:54,916 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:13:54,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:13:54,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:13:54,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:13:54,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:13:54,917 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:13:54,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:13:54,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:13:54,917 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:13:54,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:13:54,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:13:54,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:13:54,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:13:54,919 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05397c7941b2acd95b1b6d02c6c64b476ab8b290a5b56301ff8db7ca1986067b [2025-02-07 21:13:55,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:13:55,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:13:55,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:13:55,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:13:55,161 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:13:55,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.15.cil.c [2025-02-07 21:13:56,280 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3937db35b/b0fb9f313aef48f49d0cadbb4a909275/FLAG3b40098c5 [2025-02-07 21:13:56,525 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:13:56,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.15.cil.c [2025-02-07 21:13:56,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3937db35b/b0fb9f313aef48f49d0cadbb4a909275/FLAG3b40098c5 [2025-02-07 21:13:56,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3937db35b/b0fb9f313aef48f49d0cadbb4a909275 [2025-02-07 21:13:56,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:13:56,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:13:56,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:13:56,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:13:56,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:13:56,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f053edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56, skipping insertion in model container [2025-02-07 21:13:56,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:13:56,710 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.15.cil.c[706,719] [2025-02-07 21:13:56,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:13:56,820 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:13:56,828 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.15.cil.c[706,719] [2025-02-07 21:13:56,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:13:56,898 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:13:56,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56 WrapperNode [2025-02-07 21:13:56,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:13:56,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:13:56,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:13:56,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:13:56,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,942 INFO L138 Inliner]: procedures = 54, calls = 69, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 867 [2025-02-07 21:13:56,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:13:56,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:13:56,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:13:56,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:13:56,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,963 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-02-07 21:13:56,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:56,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:13:56,996 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:13:56,997 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:13:56,997 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:13:56,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (1/1) ... [2025-02-07 21:13:57,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:13:57,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:13:57,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:13:57,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:13:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:13:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-07 21:13:57,053 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-07 21:13:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-07 21:13:57,053 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-07 21:13:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-07 21:13:57,053 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-07 21:13:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-07 21:13:57,054 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-07 21:13:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-07 21:13:57,054 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-07 21:13:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-07 21:13:57,054 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-07 21:13:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:13:57,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:13:57,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:13:57,138 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:13:57,140 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:13:57,720 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: ~E_7~0 := 2; [2025-02-07 21:13:57,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L349-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1737: assume 1 == ~T8_E~0;~T8_E~0 := 2; [2025-02-07 21:13:57,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1737: assume !(1 == ~T8_E~0); [2025-02-07 21:13:57,721 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1225: assume { :end_inline_transmit12 } true; [2025-02-07 21:13:57,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L383: ~E_8~0 := 1; [2025-02-07 21:13:57,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1787: assume 1 == ~E_5~0;~E_5~0 := 2; [2025-02-07 21:13:57,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1787: assume !(1 == ~E_5~0); [2025-02-07 21:13:57,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1127: assume { :end_inline_transmit5 } true; [2025-02-07 21:13:57,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: ~E_8~0 := 2; [2025-02-07 21:13:57,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L384-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,722 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722: assume 1 == ~T5_E~0;~T5_E~0 := 2; [2025-02-07 21:13:57,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722: assume !(1 == ~T5_E~0); [2025-02-07 21:13:57,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1904: SUMMARY for call fire_delta_events(); srcloc: null [2025-02-07 21:13:57,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1772: assume 1 == ~E_2~0;~E_2~0 := 2; [2025-02-07 21:13:57,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1772: assume !(1 == ~E_2~0); [2025-02-07 21:13:57,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L418: ~E_9~0 := 1; [2025-02-07 21:13:57,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: assume 1 == ~E_12~0;~E_12~0 := 2; [2025-02-07 21:13:57,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: assume !(1 == ~E_12~0); [2025-02-07 21:13:57,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1211: assume { :end_inline_transmit11 } true; [2025-02-07 21:13:57,723 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1905: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:13:57,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1707: assume 1 == ~T2_E~0;~T2_E~0 := 2; [2025-02-07 21:13:57,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1707: assume !(1 == ~T2_E~0); [2025-02-07 21:13:57,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: ~E_9~0 := 2; [2025-02-07 21:13:57,724 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922: start_simulation_#t~ret35#1 := stop_simulation_#res#1;havoc stop_simulation_#t~ret33#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;assume { :end_inline_stop_simulation } true;assume -2147483648 <= start_simulation_#t~ret35#1 && start_simulation_#t~ret35#1 <= 2147483647;start_simulation_~tmp___0~1#1 := start_simulation_#t~ret35#1;havoc start_simulation_#t~ret35#1; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1922-1: assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret33#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1757: assume 1 == ~T12_E~0;~T12_E~0 := 2; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1757: assume !(1 == ~T12_E~0); [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1113: assume { :end_inline_transmit4 } true; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1906: SUMMARY for call reset_delta_events(); srcloc: null [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807: assume 1 == ~E_9~0;~E_9~0 := 2; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1807: assume !(1 == ~E_9~0); [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L453: ~E_10~0 := 1; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742: assume 1 == ~T9_E~0;~T9_E~0 := 2; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742: assume !(1 == ~T9_E~0); [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1197: assume { :end_inline_transmit10 } true; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L173: ~E_2~0 := 1; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1065: havoc eval_~tmp_ndt_2~0#1; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L454: ~E_10~0 := 2; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L454-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924: assume 0 != start_simulation_~tmp___0~1#1; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1924: assume !(0 != start_simulation_~tmp___0~1#1); [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1792: assume 1 == ~E_6~0;~E_6~0 := 2; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1792: assume !(1 == ~E_6~0); [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L174: ~E_2~0 := 2; [2025-02-07 21:13:57,725 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L174-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1099: assume { :end_inline_transmit3 } true; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L488: ~E_11~0 := 1; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727: assume 1 == ~T6_E~0;~T6_E~0 := 2; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727: assume !(1 == ~T6_E~0); [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1909: assume -2147483648 <= start_simulation_#t~ret34#1 && start_simulation_#t~ret34#1 <= 2147483647;start_simulation_~tmp~3#1 := start_simulation_#t~ret34#1;havoc start_simulation_#t~ret34#1; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1909-1: SUMMARY for call start_simulation_#t~ret34#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1777: assume 1 == ~E_3~0;~E_3~0 := 2; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1777: assume !(1 == ~E_3~0); [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L208: ~E_3~0 := 1; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: ~E_11~0 := 2; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L489-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827: assume 1 == ~E_13~0;~E_13~0 := 2; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827: assume !(1 == ~E_13~0); [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1183: assume { :end_inline_transmit9 } true; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L209: ~E_3~0 := 2; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1712: assume 1 == ~T3_E~0;~T3_E~0 := 2; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1712: assume !(1 == ~T3_E~0); [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L209-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: ~E_12~0 := 1; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762: assume 1 == ~T13_E~0;~T13_E~0 := 2; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1762: assume !(1 == ~T13_E~0); [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1085: assume { :end_inline_transmit2 } true; [2025-02-07 21:13:57,726 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911: assume 0 == start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 4;assume { :begin_inline_fire_time_events } true;~M_E~0 := 1; [2025-02-07 21:13:57,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911: assume !(0 == start_simulation_~tmp~3#1); [2025-02-07 21:13:57,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812: assume 1 == ~E_10~0;~E_10~0 := 2; [2025-02-07 21:13:57,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812: assume !(1 == ~E_10~0); [2025-02-07 21:13:57,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L243: ~E_4~0 := 1; [2025-02-07 21:13:57,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L524: ~E_12~0 := 2; [2025-02-07 21:13:57,728 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L524-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1697: assume 1 == ~M_E~0;~M_E~0 := 2; [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1697: assume !(1 == ~M_E~0); [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L244: ~E_4~0 := 2; [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1747: assume 1 == ~T10_E~0;~T10_E~0 := 2; [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1747: assume !(1 == ~T10_E~0); [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L244-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1169: assume { :end_inline_transmit8 } true; [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: ~E_13~0 := 1; [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp_ndt_1~0#1, eval_#t~nondet6#1, eval_~tmp_ndt_2~0#1, eval_#t~nondet7#1, eval_~tmp_ndt_3~0#1, eval_#t~nondet8#1, eval_~tmp_ndt_4~0#1, eval_#t~nondet9#1, eval_~tmp_ndt_5~0#1, eval_#t~nondet10#1, eval_~tmp_ndt_6~0#1, eval_#t~nondet11#1, eval_~tmp_ndt_7~0#1, eval_#t~nondet12#1, eval_~tmp_ndt_8~0#1, eval_#t~nondet13#1, eval_~tmp_ndt_9~0#1, eval_#t~nondet14#1, eval_~tmp_ndt_10~0#1, eval_#t~nondet15#1, eval_~tmp_ndt_11~0#1, eval_#t~nondet16#1, eval_~tmp_ndt_12~0#1, eval_#t~nondet17#1, eval_~tmp_ndt_13~0#1, eval_#t~nondet18#1, eval_~tmp_ndt_14~0#1, eval_~tmp~0#1;assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1797: assume 1 == ~E_7~0;~E_7~0 := 2; [2025-02-07 21:13:57,729 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1797: assume !(1 == ~E_7~0); [2025-02-07 21:13:57,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L278: ~E_5~0 := 1; [2025-02-07 21:13:57,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L559: ~E_13~0 := 2; [2025-02-07 21:13:57,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071: assume { :end_inline_transmit1 } true; [2025-02-07 21:13:57,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L559-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864: assume -2147483648 <= stop_simulation_#t~ret33#1 && stop_simulation_#t~ret33#1 <= 2147483647;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret33#1;havoc stop_simulation_#t~ret33#1; [2025-02-07 21:13:57,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1864-1: SUMMARY for call stop_simulation_#t~ret33#1 := exists_runnable_thread(); srcloc: null [2025-02-07 21:13:57,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1732: assume 1 == ~T7_E~0;~T7_E~0 := 2; [2025-02-07 21:13:57,730 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1732: assume !(1 == ~T7_E~0); [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914: assume { :end_inline_fire_time_events } true; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: ~E_5~0 := 2; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1782: assume 1 == ~E_4~0;~E_4~0 := 2; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1782: assume !(1 == ~E_4~0); [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L279-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1155: assume { :end_inline_transmit7 } true; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915: assume { :begin_inline_reset_time_events } true; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-1: SUMMARY for call activate_threads(); srcloc: null [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L313: ~E_6~0 := 1; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717: assume 1 == ~T4_E~0;~T4_E~0 := 2; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1717: assume !(1 == ~T4_E~0); [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866: assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866: assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1;stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1767: assume 1 == ~E_1~0;~E_1~0 := 2; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1767: assume !(1 == ~E_1~0); [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1057: assume { :end_inline_master } true; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1916: assume { :end_inline_reset_time_events } true; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: ~E_6~0 := 2; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1817: assume 1 == ~E_11~0;~E_11~0 := 2; [2025-02-07 21:13:57,731 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1817: assume !(1 == ~E_11~0); [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L314-1: SUMMARY for call immediate_notify(); srcloc: null [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239: assume { :end_inline_transmit13 } true; [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1074: assume { :end_inline_error } true; [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900: start_simulation_~kernel_st~0#1 := 3; [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1900-1: SUMMARY for call update_channels(); srcloc: null [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1702: assume 1 == ~T1_E~0;~T1_E~0 := 2; [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1702: assume !(1 == ~T1_E~0); [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L348: ~E_7~0 := 1; [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752: assume 1 == ~T11_E~0;~T11_E~0 := 2; [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1752: assume !(1 == ~T11_E~0); [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1141: assume { :end_inline_transmit6 } true; [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1802: assume 1 == ~E_8~0;~E_8~0 := 2; [2025-02-07 21:13:57,732 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1802: assume !(1 == ~E_8~0); [2025-02-07 21:13:57,810 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-02-07 21:13:57,810 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:13:57,824 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:13:57,824 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:13:57,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:13:57 BoogieIcfgContainer [2025-02-07 21:13:57,825 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:13:57,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:13:57,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:13:57,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:13:57,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:13:56" (1/3) ... [2025-02-07 21:13:57,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c16c425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:13:57, skipping insertion in model container [2025-02-07 21:13:57,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:13:56" (2/3) ... [2025-02-07 21:13:57,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c16c425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:13:57, skipping insertion in model container [2025-02-07 21:13:57,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:13:57" (3/3) ... [2025-02-07 21:13:57,833 INFO L128 eAbstractionObserver]: Analyzing ICFG transmitter.15.cil.c [2025-02-07 21:13:57,845 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:13:57,847 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG transmitter.15.cil.c that has 7 procedures, 342 locations, 1 initial locations, 17 loop locations, and 1 error locations. [2025-02-07 21:13:57,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:13:57,901 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;@6787979b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:13:57,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:13:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 253 states have (on average 1.7865612648221343) internal successors, (452), 328 states have internal predecessors, (452), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 21:13:57,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:13:57,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:57,918 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-02-07 21:13:57,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:57,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash 979055337, now seen corresponding path program 1 times [2025-02-07 21:13:57,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:57,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688803689] [2025-02-07 21:13:57,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:58,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:13:58,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:13:58,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:58,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:13:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:58,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688803689] [2025-02-07 21:13:58,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688803689] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:13:58,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:13:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:13:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489104310] [2025-02-07 21:13:58,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:13:58,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:13:58,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:58,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:13:58,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:13:58,277 INFO L87 Difference]: Start difference. First operand has 342 states, 253 states have (on average 1.7865612648221343) internal successors, (452), 328 states have internal predecessors, (452), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:13:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:58,332 INFO L93 Difference]: Finished difference Result 657 states and 918 transitions. [2025-02-07 21:13:58,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:13:58,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:13:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:58,339 INFO L225 Difference]: With dead ends: 657 [2025-02-07 21:13:58,340 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:13:58,344 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-02-07 21:13:58,346 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 440 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:58,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 445 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:13:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:13:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:13:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.5265700483091786) internal successors, (316), 207 states have internal predecessors, (316), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:13:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 326 transitions. [2025-02-07 21:13:58,380 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 326 transitions. Word has length 165 [2025-02-07 21:13:58,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:58,380 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 326 transitions. [2025-02-07 21:13:58,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:13:58,381 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 326 transitions. [2025-02-07 21:13:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:13:58,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:58,383 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-02-07 21:13:58,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:13:58,383 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash 806641256, now seen corresponding path program 1 times [2025-02-07 21:13:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:58,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334734259] [2025-02-07 21:13:58,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:58,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:13:58,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:13:58,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:58,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:13:58,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:58,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334734259] [2025-02-07 21:13:58,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334734259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:13:58,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:13:58,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:13:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338306882] [2025-02-07 21:13:58,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:13:58,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:13:58,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:58,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:13:58,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:13:58,518 INFO L87 Difference]: Start difference. First operand 218 states and 326 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:13:58,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:58,539 INFO L93 Difference]: Finished difference Result 419 states and 624 transitions. [2025-02-07 21:13:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:13:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:13:58,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:58,541 INFO L225 Difference]: With dead ends: 419 [2025-02-07 21:13:58,543 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:13:58,544 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-02-07 21:13:58,545 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 311 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:58,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 324 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:13:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:13:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:13:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.5217391304347827) internal successors, (315), 207 states have internal predecessors, (315), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:13:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 325 transitions. [2025-02-07 21:13:58,556 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 325 transitions. Word has length 165 [2025-02-07 21:13:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:58,556 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 325 transitions. [2025-02-07 21:13:58,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:13:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 325 transitions. [2025-02-07 21:13:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:13:58,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:58,558 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-02-07 21:13:58,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:13:58,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:58,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash 613710055, now seen corresponding path program 1 times [2025-02-07 21:13:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002059661] [2025-02-07 21:13:58,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:58,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:13:58,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:13:58,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:58,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:13:58,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:58,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002059661] [2025-02-07 21:13:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002059661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:13:58,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:13:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:13:58,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985312199] [2025-02-07 21:13:58,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:13:58,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:13:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:58,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:13:58,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:13:58,801 INFO L87 Difference]: Start difference. First operand 218 states and 325 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-02-07 21:13:59,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:59,034 INFO L93 Difference]: Finished difference Result 414 states and 616 transitions. [2025-02-07 21:13:59,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:13:59,036 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-02-07 21:13:59,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:59,038 INFO L225 Difference]: With dead ends: 414 [2025-02-07 21:13:59,038 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:13:59,038 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-02-07 21:13:59,041 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 525 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:59,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 483 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:13:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:13:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:13:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.5120772946859904) internal successors, (313), 207 states have internal predecessors, (313), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:13:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 323 transitions. [2025-02-07 21:13:59,050 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 323 transitions. Word has length 165 [2025-02-07 21:13:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:59,052 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 323 transitions. [2025-02-07 21:13:59,052 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-02-07 21:13:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 323 transitions. [2025-02-07 21:13:59,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:13:59,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:59,055 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-02-07 21:13:59,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:13:59,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:59,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1476246535, now seen corresponding path program 1 times [2025-02-07 21:13:59,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:59,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766714672] [2025-02-07 21:13:59,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:59,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:59,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:13:59,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:13:59,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:59,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:13:59,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:59,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766714672] [2025-02-07 21:13:59,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766714672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:13:59,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:13:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:13:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962627319] [2025-02-07 21:13:59,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:13:59,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:13:59,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:59,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:13:59,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:13:59,243 INFO L87 Difference]: Start difference. First operand 218 states and 323 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-02-07 21:13:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:59,456 INFO L93 Difference]: Finished difference Result 440 states and 662 transitions. [2025-02-07 21:13:59,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:13:59,456 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-02-07 21:13:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:59,459 INFO L225 Difference]: With dead ends: 440 [2025-02-07 21:13:59,459 INFO L226 Difference]: Without dead ends: 245 [2025-02-07 21:13:59,460 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-02-07 21:13:59,460 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 521 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:59,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 634 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:13:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-07 21:13:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 218. [2025-02-07 21:13:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.5072463768115942) internal successors, (312), 207 states have internal predecessors, (312), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:13:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 322 transitions. [2025-02-07 21:13:59,475 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 322 transitions. Word has length 165 [2025-02-07 21:13:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:59,475 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 322 transitions. [2025-02-07 21:13:59,476 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-02-07 21:13:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 322 transitions. [2025-02-07 21:13:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:13:59,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:59,479 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-02-07 21:13:59,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:13:59,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:59,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:59,479 INFO L85 PathProgramCache]: Analyzing trace with hash -457959864, now seen corresponding path program 1 times [2025-02-07 21:13:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671618776] [2025-02-07 21:13:59,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:59,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:13:59,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:13:59,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:59,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:13:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:13:59,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:13:59,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671618776] [2025-02-07 21:13:59,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671618776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:13:59,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:13:59,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:13:59,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616929732] [2025-02-07 21:13:59,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:13:59,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:13:59,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:13:59,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:13:59,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:13:59,659 INFO L87 Difference]: Start difference. First operand 218 states and 322 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-02-07 21:13:59,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:13:59,938 INFO L93 Difference]: Finished difference Result 503 states and 735 transitions. [2025-02-07 21:13:59,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:13:59,938 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-02-07 21:13:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:13:59,940 INFO L225 Difference]: With dead ends: 503 [2025-02-07 21:13:59,940 INFO L226 Difference]: Without dead ends: 309 [2025-02-07 21:13:59,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:13:59,941 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 569 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:13:59,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1165 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:13:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-02-07 21:13:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 218. [2025-02-07 21:13:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.502415458937198) internal successors, (311), 207 states have internal predecessors, (311), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:13:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 321 transitions. [2025-02-07 21:13:59,950 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 321 transitions. Word has length 165 [2025-02-07 21:13:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:13:59,950 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 321 transitions. [2025-02-07 21:13:59,950 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-02-07 21:13:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 321 transitions. [2025-02-07 21:13:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:13:59,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:13:59,952 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-02-07 21:13:59,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:13:59,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:13:59,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:13:59,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1419309031, now seen corresponding path program 1 times [2025-02-07 21:13:59,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:13:59,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449992382] [2025-02-07 21:13:59,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:13:59,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:13:59,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:13:59,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:13:59,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:13:59,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:00,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:00,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449992382] [2025-02-07 21:14:00,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449992382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:00,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:00,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:00,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873381446] [2025-02-07 21:14:00,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:00,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:00,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:00,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:00,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:00,098 INFO L87 Difference]: Start difference. First operand 218 states and 321 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-02-07 21:14:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:00,353 INFO L93 Difference]: Finished difference Result 501 states and 730 transitions. [2025-02-07 21:14:00,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:00,354 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-02-07 21:14:00,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:00,356 INFO L225 Difference]: With dead ends: 501 [2025-02-07 21:14:00,356 INFO L226 Difference]: Without dead ends: 308 [2025-02-07 21:14:00,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:00,358 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 565 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:00,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1153 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-07 21:14:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 218. [2025-02-07 21:14:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.497584541062802) internal successors, (310), 207 states have internal predecessors, (310), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 320 transitions. [2025-02-07 21:14:00,371 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 320 transitions. Word has length 165 [2025-02-07 21:14:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:00,371 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 320 transitions. [2025-02-07 21:14:00,371 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-02-07 21:14:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 320 transitions. [2025-02-07 21:14:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:00,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:00,373 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-02-07 21:14:00,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:14:00,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:00,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1341318760, now seen corresponding path program 1 times [2025-02-07 21:14:00,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:00,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715991545] [2025-02-07 21:14:00,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:00,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:00,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:00,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:00,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:00,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:00,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:00,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715991545] [2025-02-07 21:14:00,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715991545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:00,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:00,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970294733] [2025-02-07 21:14:00,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:00,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:00,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:00,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:00,550 INFO L87 Difference]: Start difference. First operand 218 states and 320 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-02-07 21:14:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:00,816 INFO L93 Difference]: Finished difference Result 499 states and 725 transitions. [2025-02-07 21:14:00,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:00,816 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-02-07 21:14:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:00,817 INFO L225 Difference]: With dead ends: 499 [2025-02-07 21:14:00,818 INFO L226 Difference]: Without dead ends: 307 [2025-02-07 21:14:00,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:00,818 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 561 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:00,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1141 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-07 21:14:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 218. [2025-02-07 21:14:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4927536231884058) internal successors, (309), 207 states have internal predecessors, (309), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 319 transitions. [2025-02-07 21:14:00,831 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 319 transitions. Word has length 165 [2025-02-07 21:14:00,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:00,831 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 319 transitions. [2025-02-07 21:14:00,831 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-02-07 21:14:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 319 transitions. [2025-02-07 21:14:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:00,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:00,832 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-02-07 21:14:00,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:14:00,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:00,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:00,833 INFO L85 PathProgramCache]: Analyzing trace with hash -600859705, now seen corresponding path program 1 times [2025-02-07 21:14:00,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:00,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132785894] [2025-02-07 21:14:00,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:00,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:00,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:00,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:00,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:00,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:00,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132785894] [2025-02-07 21:14:00,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132785894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:00,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599662285] [2025-02-07 21:14:00,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:00,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:00,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:00,992 INFO L87 Difference]: Start difference. First operand 218 states and 319 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-02-07 21:14:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:01,251 INFO L93 Difference]: Finished difference Result 497 states and 720 transitions. [2025-02-07 21:14:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:01,252 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-02-07 21:14:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:01,253 INFO L225 Difference]: With dead ends: 497 [2025-02-07 21:14:01,253 INFO L226 Difference]: Without dead ends: 306 [2025-02-07 21:14:01,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:01,253 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 557 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:01,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1129 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-07 21:14:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 218. [2025-02-07 21:14:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4879227053140096) internal successors, (308), 207 states have internal predecessors, (308), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 318 transitions. [2025-02-07 21:14:01,263 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 318 transitions. Word has length 165 [2025-02-07 21:14:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:01,263 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 318 transitions. [2025-02-07 21:14:01,266 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-02-07 21:14:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 318 transitions. [2025-02-07 21:14:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:01,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:01,267 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-02-07 21:14:01,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:14:01,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:01,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1494794616, now seen corresponding path program 1 times [2025-02-07 21:14:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:01,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805904811] [2025-02-07 21:14:01,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:01,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:01,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:01,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:01,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:01,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:01,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:01,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805904811] [2025-02-07 21:14:01,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805904811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:01,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:01,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:01,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113139928] [2025-02-07 21:14:01,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:01,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:01,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:01,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:01,411 INFO L87 Difference]: Start difference. First operand 218 states and 318 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-02-07 21:14:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:01,641 INFO L93 Difference]: Finished difference Result 495 states and 715 transitions. [2025-02-07 21:14:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:01,642 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-02-07 21:14:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:01,643 INFO L225 Difference]: With dead ends: 495 [2025-02-07 21:14:01,643 INFO L226 Difference]: Without dead ends: 305 [2025-02-07 21:14:01,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:01,644 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 569 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:01,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 748 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-07 21:14:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 218. [2025-02-07 21:14:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4830917874396135) internal successors, (307), 207 states have internal predecessors, (307), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 317 transitions. [2025-02-07 21:14:01,655 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 317 transitions. Word has length 165 [2025-02-07 21:14:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:01,656 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 317 transitions. [2025-02-07 21:14:01,656 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-02-07 21:14:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 317 transitions. [2025-02-07 21:14:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:01,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:01,657 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-02-07 21:14:01,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:14:01,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:01,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:01,657 INFO L85 PathProgramCache]: Analyzing trace with hash -415252569, now seen corresponding path program 1 times [2025-02-07 21:14:01,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:01,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578781489] [2025-02-07 21:14:01,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:01,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:01,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:01,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:01,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:01,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:01,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578781489] [2025-02-07 21:14:01,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578781489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:01,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:01,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:01,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469315851] [2025-02-07 21:14:01,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:01,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:01,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:01,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:01,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:01,747 INFO L87 Difference]: Start difference. First operand 218 states and 317 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-02-07 21:14:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:01,919 INFO L93 Difference]: Finished difference Result 428 states and 632 transitions. [2025-02-07 21:14:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:01,920 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-02-07 21:14:01,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:01,921 INFO L225 Difference]: With dead ends: 428 [2025-02-07 21:14:01,921 INFO L226 Difference]: Without dead ends: 239 [2025-02-07 21:14:01,921 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-02-07 21:14:01,922 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 503 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:01,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 586 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-07 21:14:01,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 218. [2025-02-07 21:14:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4782608695652173) internal successors, (306), 207 states have internal predecessors, (306), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 316 transitions. [2025-02-07 21:14:01,935 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 316 transitions. Word has length 165 [2025-02-07 21:14:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:01,936 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 316 transitions. [2025-02-07 21:14:01,936 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-02-07 21:14:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 316 transitions. [2025-02-07 21:14:01,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:01,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:01,937 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-02-07 21:14:01,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:14:01,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:01,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash -380428632, now seen corresponding path program 1 times [2025-02-07 21:14:01,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696305709] [2025-02-07 21:14:01,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:01,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:01,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:01,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:01,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:02,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696305709] [2025-02-07 21:14:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696305709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:02,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:02,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887477835] [2025-02-07 21:14:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:02,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:02,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:02,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:02,025 INFO L87 Difference]: Start difference. First operand 218 states and 316 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-02-07 21:14:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:02,195 INFO L93 Difference]: Finished difference Result 426 states and 627 transitions. [2025-02-07 21:14:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:02,196 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-02-07 21:14:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:02,197 INFO L225 Difference]: With dead ends: 426 [2025-02-07 21:14:02,197 INFO L226 Difference]: Without dead ends: 238 [2025-02-07 21:14:02,198 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-02-07 21:14:02,199 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 500 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:02,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 578 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-07 21:14:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 218. [2025-02-07 21:14:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4734299516908214) internal successors, (305), 207 states have internal predecessors, (305), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 315 transitions. [2025-02-07 21:14:02,209 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 315 transitions. Word has length 165 [2025-02-07 21:14:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:02,209 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 315 transitions. [2025-02-07 21:14:02,209 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-02-07 21:14:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 315 transitions. [2025-02-07 21:14:02,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:02,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:02,210 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-02-07 21:14:02,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-07 21:14:02,211 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:02,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:02,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1975999367, now seen corresponding path program 1 times [2025-02-07 21:14:02,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:02,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676312298] [2025-02-07 21:14:02,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:02,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:02,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:02,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:02,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:02,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:02,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:02,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676312298] [2025-02-07 21:14:02,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676312298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:02,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:02,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:02,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471057249] [2025-02-07 21:14:02,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:02,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:02,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:02,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:02,325 INFO L87 Difference]: Start difference. First operand 218 states and 315 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-02-07 21:14:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:02,592 INFO L93 Difference]: Finished difference Result 489 states and 700 transitions. [2025-02-07 21:14:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:02,593 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-02-07 21:14:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:02,595 INFO L225 Difference]: With dead ends: 489 [2025-02-07 21:14:02,595 INFO L226 Difference]: Without dead ends: 302 [2025-02-07 21:14:02,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:02,596 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 541 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:02,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1081 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-07 21:14:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 218. [2025-02-07 21:14:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4685990338164252) internal successors, (304), 207 states have internal predecessors, (304), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:02,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 314 transitions. [2025-02-07 21:14:02,614 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 314 transitions. Word has length 165 [2025-02-07 21:14:02,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:02,614 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 314 transitions. [2025-02-07 21:14:02,614 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-02-07 21:14:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 314 transitions. [2025-02-07 21:14:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:02,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:02,619 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-02-07 21:14:02,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-07 21:14:02,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:02,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash 527992520, now seen corresponding path program 1 times [2025-02-07 21:14:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:02,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165023250] [2025-02-07 21:14:02,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:02,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:02,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:02,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:02,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165023250] [2025-02-07 21:14:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165023250] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:02,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:02,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:02,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044450232] [2025-02-07 21:14:02,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:02,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:02,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:02,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:02,723 INFO L87 Difference]: Start difference. First operand 218 states and 314 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-02-07 21:14:02,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:02,913 INFO L93 Difference]: Finished difference Result 422 states and 617 transitions. [2025-02-07 21:14:02,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:02,913 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-02-07 21:14:02,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:02,915 INFO L225 Difference]: With dead ends: 422 [2025-02-07 21:14:02,915 INFO L226 Difference]: Without dead ends: 236 [2025-02-07 21:14:02,915 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-02-07 21:14:02,915 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 494 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:02,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 562 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:02,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-07 21:14:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2025-02-07 21:14:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.463768115942029) internal successors, (303), 207 states have internal predecessors, (303), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 313 transitions. [2025-02-07 21:14:02,929 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 313 transitions. Word has length 165 [2025-02-07 21:14:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:02,929 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 313 transitions. [2025-02-07 21:14:02,930 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-02-07 21:14:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 313 transitions. [2025-02-07 21:14:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:02,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:02,931 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-02-07 21:14:02,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-07 21:14:02,931 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:02,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1866755943, now seen corresponding path program 1 times [2025-02-07 21:14:02,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317268656] [2025-02-07 21:14:02,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:02,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:02,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:02,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:02,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:02,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:03,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:03,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:03,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317268656] [2025-02-07 21:14:03,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317268656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:03,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:03,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:03,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316656723] [2025-02-07 21:14:03,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:03,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:03,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:03,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:03,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:03,017 INFO L87 Difference]: Start difference. First operand 218 states and 313 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-02-07 21:14:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:03,181 INFO L93 Difference]: Finished difference Result 420 states and 612 transitions. [2025-02-07 21:14:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:03,182 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-02-07 21:14:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:03,182 INFO L225 Difference]: With dead ends: 420 [2025-02-07 21:14:03,183 INFO L226 Difference]: Without dead ends: 235 [2025-02-07 21:14:03,183 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-02-07 21:14:03,183 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 491 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:03,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 554 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-07 21:14:03,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 218. [2025-02-07 21:14:03,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.458937198067633) internal successors, (302), 207 states have internal predecessors, (302), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:03,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 312 transitions. [2025-02-07 21:14:03,196 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 312 transitions. Word has length 165 [2025-02-07 21:14:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:03,196 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 312 transitions. [2025-02-07 21:14:03,196 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-02-07 21:14:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 312 transitions. [2025-02-07 21:14:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:03,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:03,197 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-02-07 21:14:03,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-07 21:14:03,198 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:03,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash 2048489192, now seen corresponding path program 1 times [2025-02-07 21:14:03,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:03,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972848703] [2025-02-07 21:14:03,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:03,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:03,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:03,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:03,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:03,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:03,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972848703] [2025-02-07 21:14:03,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972848703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:03,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:03,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:03,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062037420] [2025-02-07 21:14:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:03,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:03,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:03,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:03,278 INFO L87 Difference]: Start difference. First operand 218 states and 312 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-02-07 21:14:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:03,439 INFO L93 Difference]: Finished difference Result 418 states and 607 transitions. [2025-02-07 21:14:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:03,440 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-02-07 21:14:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:03,441 INFO L225 Difference]: With dead ends: 418 [2025-02-07 21:14:03,441 INFO L226 Difference]: Without dead ends: 234 [2025-02-07 21:14:03,441 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-02-07 21:14:03,441 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 488 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:03,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 546 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-07 21:14:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 218. [2025-02-07 21:14:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4541062801932367) internal successors, (301), 207 states have internal predecessors, (301), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 311 transitions. [2025-02-07 21:14:03,452 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 311 transitions. Word has length 165 [2025-02-07 21:14:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:03,452 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 311 transitions. [2025-02-07 21:14:03,453 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-02-07 21:14:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 311 transitions. [2025-02-07 21:14:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:03,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:03,454 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-02-07 21:14:03,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-07 21:14:03,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:03,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2102068409, now seen corresponding path program 1 times [2025-02-07 21:14:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:03,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338587669] [2025-02-07 21:14:03,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:03,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:03,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:03,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:03,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:03,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:03,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338587669] [2025-02-07 21:14:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338587669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303382707] [2025-02-07 21:14:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:03,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:03,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:03,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:03,556 INFO L87 Difference]: Start difference. First operand 218 states and 311 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-02-07 21:14:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:03,813 INFO L93 Difference]: Finished difference Result 481 states and 680 transitions. [2025-02-07 21:14:03,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:03,813 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-02-07 21:14:03,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:03,814 INFO L225 Difference]: With dead ends: 481 [2025-02-07 21:14:03,814 INFO L226 Difference]: Without dead ends: 298 [2025-02-07 21:14:03,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:03,815 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 525 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:03,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1033 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-07 21:14:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 218. [2025-02-07 21:14:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4492753623188406) internal successors, (300), 207 states have internal predecessors, (300), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 310 transitions. [2025-02-07 21:14:03,826 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 310 transitions. Word has length 165 [2025-02-07 21:14:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:03,826 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 310 transitions. [2025-02-07 21:14:03,826 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-02-07 21:14:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 310 transitions. [2025-02-07 21:14:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:03,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:03,828 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-02-07 21:14:03,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-07 21:14:03,828 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:03,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1920462600, now seen corresponding path program 1 times [2025-02-07 21:14:03,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:03,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358890764] [2025-02-07 21:14:03,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:03,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:03,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:03,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:03,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:03,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:03,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:03,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358890764] [2025-02-07 21:14:03,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358890764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:03,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:03,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237428052] [2025-02-07 21:14:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:03,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:03,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:03,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:03,897 INFO L87 Difference]: Start difference. First operand 218 states and 310 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-02-07 21:14:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:04,054 INFO L93 Difference]: Finished difference Result 414 states and 597 transitions. [2025-02-07 21:14:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:04,054 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-02-07 21:14:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:04,055 INFO L225 Difference]: With dead ends: 414 [2025-02-07 21:14:04,055 INFO L226 Difference]: Without dead ends: 232 [2025-02-07 21:14:04,056 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-02-07 21:14:04,056 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 507 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:04,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 478 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-07 21:14:04,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 218. [2025-02-07 21:14:04,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4444444444444444) internal successors, (299), 207 states have internal predecessors, (299), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 309 transitions. [2025-02-07 21:14:04,067 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 309 transitions. Word has length 165 [2025-02-07 21:14:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:04,067 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 309 transitions. [2025-02-07 21:14:04,067 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-02-07 21:14:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 309 transitions. [2025-02-07 21:14:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:04,068 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:04,068 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-02-07 21:14:04,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-07 21:14:04,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:04,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash 110559015, now seen corresponding path program 1 times [2025-02-07 21:14:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:04,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99917813] [2025-02-07 21:14:04,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:04,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:04,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:04,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:04,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:04,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:04,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99917813] [2025-02-07 21:14:04,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99917813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:04,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:04,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:04,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893811845] [2025-02-07 21:14:04,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:04,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:04,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:04,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:04,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:04,168 INFO L87 Difference]: Start difference. First operand 218 states and 309 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-02-07 21:14:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:04,412 INFO L93 Difference]: Finished difference Result 477 states and 670 transitions. [2025-02-07 21:14:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:04,413 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-02-07 21:14:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:04,414 INFO L225 Difference]: With dead ends: 477 [2025-02-07 21:14:04,414 INFO L226 Difference]: Without dead ends: 296 [2025-02-07 21:14:04,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:04,415 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 517 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:04,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1009 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-07 21:14:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 218. [2025-02-07 21:14:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4396135265700483) internal successors, (298), 207 states have internal predecessors, (298), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 308 transitions. [2025-02-07 21:14:04,424 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 308 transitions. Word has length 165 [2025-02-07 21:14:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:04,424 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 308 transitions. [2025-02-07 21:14:04,424 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-02-07 21:14:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 308 transitions. [2025-02-07 21:14:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:04,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:04,425 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-02-07 21:14:04,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-07 21:14:04,426 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:04,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash -363466968, now seen corresponding path program 1 times [2025-02-07 21:14:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:04,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138405577] [2025-02-07 21:14:04,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:04,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:04,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:04,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:04,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:04,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:04,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138405577] [2025-02-07 21:14:04,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138405577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:04,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:04,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296645760] [2025-02-07 21:14:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:04,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:04,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:04,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:04,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:04,492 INFO L87 Difference]: Start difference. First operand 218 states and 308 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-02-07 21:14:04,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:04,679 INFO L93 Difference]: Finished difference Result 410 states and 587 transitions. [2025-02-07 21:14:04,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:04,680 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-02-07 21:14:04,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:04,681 INFO L225 Difference]: With dead ends: 410 [2025-02-07 21:14:04,681 INFO L226 Difference]: Without dead ends: 230 [2025-02-07 21:14:04,681 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-02-07 21:14:04,682 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 476 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:04,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 514 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-07 21:14:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2025-02-07 21:14:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.434782608695652) internal successors, (297), 207 states have internal predecessors, (297), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 307 transitions. [2025-02-07 21:14:04,697 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 307 transitions. Word has length 165 [2025-02-07 21:14:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:04,697 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 307 transitions. [2025-02-07 21:14:04,697 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-02-07 21:14:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 307 transitions. [2025-02-07 21:14:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:04,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:04,698 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-02-07 21:14:04,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-07 21:14:04,699 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:04,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -655852793, now seen corresponding path program 1 times [2025-02-07 21:14:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863750421] [2025-02-07 21:14:04,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:04,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:04,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:04,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:04,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:04,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:04,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863750421] [2025-02-07 21:14:04,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863750421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:04,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:04,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:04,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114797790] [2025-02-07 21:14:04,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:04,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:04,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:04,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:04,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:04,779 INFO L87 Difference]: Start difference. First operand 218 states and 307 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-02-07 21:14:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:04,932 INFO L93 Difference]: Finished difference Result 408 states and 582 transitions. [2025-02-07 21:14:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:04,932 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-02-07 21:14:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:04,933 INFO L225 Difference]: With dead ends: 408 [2025-02-07 21:14:04,933 INFO L226 Difference]: Without dead ends: 229 [2025-02-07 21:14:04,934 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-02-07 21:14:04,934 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 473 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:04,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 506 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-07 21:14:04,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 218. [2025-02-07 21:14:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.429951690821256) internal successors, (296), 207 states have internal predecessors, (296), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 306 transitions. [2025-02-07 21:14:04,944 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 306 transitions. Word has length 165 [2025-02-07 21:14:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:04,944 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 306 transitions. [2025-02-07 21:14:04,944 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-02-07 21:14:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 306 transitions. [2025-02-07 21:14:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:04,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:04,945 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-02-07 21:14:04,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-07 21:14:04,945 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:04,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:04,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1274378056, now seen corresponding path program 1 times [2025-02-07 21:14:04,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:04,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381509271] [2025-02-07 21:14:04,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:04,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:04,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:04,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:04,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:05,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381509271] [2025-02-07 21:14:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381509271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:05,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:05,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:05,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795959127] [2025-02-07 21:14:05,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:05,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:05,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:05,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:05,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:05,046 INFO L87 Difference]: Start difference. First operand 218 states and 306 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-02-07 21:14:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:05,282 INFO L93 Difference]: Finished difference Result 471 states and 655 transitions. [2025-02-07 21:14:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:05,282 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-02-07 21:14:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:05,284 INFO L225 Difference]: With dead ends: 471 [2025-02-07 21:14:05,284 INFO L226 Difference]: Without dead ends: 293 [2025-02-07 21:14:05,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:05,285 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 505 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:05,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 973 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-07 21:14:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 218. [2025-02-07 21:14:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4251207729468598) internal successors, (295), 207 states have internal predecessors, (295), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2025-02-07 21:14:05,296 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 165 [2025-02-07 21:14:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:05,296 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2025-02-07 21:14:05,296 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-02-07 21:14:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2025-02-07 21:14:05,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:05,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:05,297 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-02-07 21:14:05,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-07 21:14:05,297 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:05,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1059548903, now seen corresponding path program 1 times [2025-02-07 21:14:05,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:05,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203720598] [2025-02-07 21:14:05,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:05,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:05,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:05,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:05,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:05,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:05,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:05,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203720598] [2025-02-07 21:14:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203720598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:05,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:05,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775304513] [2025-02-07 21:14:05,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:05,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:05,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:05,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:05,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:05,373 INFO L87 Difference]: Start difference. First operand 218 states and 305 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-02-07 21:14:05,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:05,538 INFO L93 Difference]: Finished difference Result 404 states and 572 transitions. [2025-02-07 21:14:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:05,540 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-02-07 21:14:05,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:05,542 INFO L225 Difference]: With dead ends: 404 [2025-02-07 21:14:05,542 INFO L226 Difference]: Without dead ends: 227 [2025-02-07 21:14:05,542 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-02-07 21:14:05,543 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 467 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:05,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 490 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-07 21:14:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2025-02-07 21:14:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4202898550724639) internal successors, (294), 207 states have internal predecessors, (294), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 304 transitions. [2025-02-07 21:14:05,555 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 304 transitions. Word has length 165 [2025-02-07 21:14:05,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:05,555 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 304 transitions. [2025-02-07 21:14:05,555 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-02-07 21:14:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 304 transitions. [2025-02-07 21:14:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:05,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:05,556 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-02-07 21:14:05,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-07 21:14:05,556 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1441233048, now seen corresponding path program 1 times [2025-02-07 21:14:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782201187] [2025-02-07 21:14:05,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:05,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:05,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:05,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:05,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:05,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:05,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782201187] [2025-02-07 21:14:05,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782201187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:05,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:05,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:05,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424096428] [2025-02-07 21:14:05,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:05,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:05,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:05,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:05,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:05,651 INFO L87 Difference]: Start difference. First operand 218 states and 304 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-02-07 21:14:05,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:05,907 INFO L93 Difference]: Finished difference Result 467 states and 645 transitions. [2025-02-07 21:14:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:05,907 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-02-07 21:14:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:05,909 INFO L225 Difference]: With dead ends: 467 [2025-02-07 21:14:05,909 INFO L226 Difference]: Without dead ends: 291 [2025-02-07 21:14:05,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:05,909 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 497 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:05,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 949 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-07 21:14:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 218. [2025-02-07 21:14:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4154589371980677) internal successors, (293), 207 states have internal predecessors, (293), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 303 transitions. [2025-02-07 21:14:05,920 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 303 transitions. Word has length 165 [2025-02-07 21:14:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:05,920 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 303 transitions. [2025-02-07 21:14:05,921 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-02-07 21:14:05,921 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 303 transitions. [2025-02-07 21:14:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:05,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:05,922 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-02-07 21:14:05,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-07 21:14:05,922 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:05,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash -967714105, now seen corresponding path program 1 times [2025-02-07 21:14:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:05,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099158976] [2025-02-07 21:14:05,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:05,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:05,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:05,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:05,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:05,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:06,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099158976] [2025-02-07 21:14:06,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099158976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:06,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:06,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:06,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005930737] [2025-02-07 21:14:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:06,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:06,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:06,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:06,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:06,004 INFO L87 Difference]: Start difference. First operand 218 states and 303 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-02-07 21:14:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:06,246 INFO L93 Difference]: Finished difference Result 465 states and 640 transitions. [2025-02-07 21:14:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:06,246 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-02-07 21:14:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:06,248 INFO L225 Difference]: With dead ends: 465 [2025-02-07 21:14:06,248 INFO L226 Difference]: Without dead ends: 290 [2025-02-07 21:14:06,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:06,249 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 493 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:06,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 937 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-07 21:14:06,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 218. [2025-02-07 21:14:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4106280193236715) internal successors, (292), 207 states have internal predecessors, (292), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:06,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 302 transitions. [2025-02-07 21:14:06,269 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 302 transitions. Word has length 165 [2025-02-07 21:14:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:06,269 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 302 transitions. [2025-02-07 21:14:06,269 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-02-07 21:14:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 302 transitions. [2025-02-07 21:14:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:06,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:06,270 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-02-07 21:14:06,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-07 21:14:06,271 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:06,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash -536797304, now seen corresponding path program 1 times [2025-02-07 21:14:06,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:06,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415358639] [2025-02-07 21:14:06,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:06,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:06,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:06,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:06,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415358639] [2025-02-07 21:14:06,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415358639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:06,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:06,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:06,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904939899] [2025-02-07 21:14:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:06,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:06,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:06,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:06,365 INFO L87 Difference]: Start difference. First operand 218 states and 302 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-02-07 21:14:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:06,588 INFO L93 Difference]: Finished difference Result 463 states and 635 transitions. [2025-02-07 21:14:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:06,589 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-02-07 21:14:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:06,590 INFO L225 Difference]: With dead ends: 463 [2025-02-07 21:14:06,590 INFO L226 Difference]: Without dead ends: 289 [2025-02-07 21:14:06,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:06,591 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 505 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:06,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 652 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:06,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-07 21:14:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 218. [2025-02-07 21:14:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4057971014492754) internal successors, (291), 207 states have internal predecessors, (291), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 301 transitions. [2025-02-07 21:14:06,602 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 301 transitions. Word has length 165 [2025-02-07 21:14:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:06,602 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 301 transitions. [2025-02-07 21:14:06,603 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-02-07 21:14:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 301 transitions. [2025-02-07 21:14:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:06,603 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:06,603 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-02-07 21:14:06,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-07 21:14:06,604 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:06,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash 585481895, now seen corresponding path program 1 times [2025-02-07 21:14:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:06,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777178111] [2025-02-07 21:14:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:06,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:06,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:06,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:06,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:06,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:06,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:06,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777178111] [2025-02-07 21:14:06,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777178111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:06,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:06,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:06,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272856647] [2025-02-07 21:14:06,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:06,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:06,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:06,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:06,672 INFO L87 Difference]: Start difference. First operand 218 states and 301 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-02-07 21:14:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:06,838 INFO L93 Difference]: Finished difference Result 396 states and 552 transitions. [2025-02-07 21:14:06,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:06,838 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-02-07 21:14:06,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:06,839 INFO L225 Difference]: With dead ends: 396 [2025-02-07 21:14:06,839 INFO L226 Difference]: Without dead ends: 223 [2025-02-07 21:14:06,840 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-02-07 21:14:06,840 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 455 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:06,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 458 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:06,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-07 21:14:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 218. [2025-02-07 21:14:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.4009661835748792) internal successors, (290), 207 states have internal predecessors, (290), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 300 transitions. [2025-02-07 21:14:06,850 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 300 transitions. Word has length 165 [2025-02-07 21:14:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:06,851 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 300 transitions. [2025-02-07 21:14:06,851 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-02-07 21:14:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 300 transitions. [2025-02-07 21:14:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:06,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:06,852 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-02-07 21:14:06,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-07 21:14:06,852 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:06,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1317978200, now seen corresponding path program 1 times [2025-02-07 21:14:06,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:06,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959395236] [2025-02-07 21:14:06,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:06,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:06,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:06,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:06,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:06,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:06,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:06,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959395236] [2025-02-07 21:14:06,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959395236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:06,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:06,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387021134] [2025-02-07 21:14:06,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:06,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:06,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:06,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:06,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:06,915 INFO L87 Difference]: Start difference. First operand 218 states and 300 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-02-07 21:14:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:07,070 INFO L93 Difference]: Finished difference Result 394 states and 547 transitions. [2025-02-07 21:14:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:07,071 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-02-07 21:14:07,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:07,072 INFO L225 Difference]: With dead ends: 394 [2025-02-07 21:14:07,072 INFO L226 Difference]: Without dead ends: 222 [2025-02-07 21:14:07,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-02-07 21:14:07,073 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 452 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:07,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 450 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-07 21:14:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2025-02-07 21:14:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.396135265700483) internal successors, (289), 207 states have internal predecessors, (289), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 299 transitions. [2025-02-07 21:14:07,083 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 299 transitions. Word has length 165 [2025-02-07 21:14:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:07,083 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 299 transitions. [2025-02-07 21:14:07,083 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-02-07 21:14:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 299 transitions. [2025-02-07 21:14:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:07,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:07,084 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-02-07 21:14:07,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-07 21:14:07,084 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:07,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash 283187847, now seen corresponding path program 1 times [2025-02-07 21:14:07,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:07,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740370242] [2025-02-07 21:14:07,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:07,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:07,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:07,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:07,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:07,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:07,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:07,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740370242] [2025-02-07 21:14:07,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740370242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:07,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:07,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:07,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010591259] [2025-02-07 21:14:07,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:07,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:07,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:07,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:07,189 INFO L87 Difference]: Start difference. First operand 218 states and 299 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-02-07 21:14:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:07,481 INFO L93 Difference]: Finished difference Result 457 states and 620 transitions. [2025-02-07 21:14:07,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:07,481 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-02-07 21:14:07,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:07,483 INFO L225 Difference]: With dead ends: 457 [2025-02-07 21:14:07,483 INFO L226 Difference]: Without dead ends: 286 [2025-02-07 21:14:07,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:07,483 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 477 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:07,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 889 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-07 21:14:07,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 218. [2025-02-07 21:14:07,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.391304347826087) internal successors, (288), 207 states have internal predecessors, (288), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:07,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 298 transitions. [2025-02-07 21:14:07,508 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 298 transitions. Word has length 165 [2025-02-07 21:14:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:07,508 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 298 transitions. [2025-02-07 21:14:07,508 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-02-07 21:14:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 298 transitions. [2025-02-07 21:14:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:07,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:07,511 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-02-07 21:14:07,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-07 21:14:07,511 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:07,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash -357898296, now seen corresponding path program 1 times [2025-02-07 21:14:07,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:07,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570098161] [2025-02-07 21:14:07,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:07,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:07,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:07,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:07,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:07,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:07,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570098161] [2025-02-07 21:14:07,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570098161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:07,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:07,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:07,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490030792] [2025-02-07 21:14:07,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:07,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:07,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:07,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:07,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:07,602 INFO L87 Difference]: Start difference. First operand 218 states and 298 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-02-07 21:14:07,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:07,851 INFO L93 Difference]: Finished difference Result 455 states and 615 transitions. [2025-02-07 21:14:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:07,851 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-02-07 21:14:07,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:07,853 INFO L225 Difference]: With dead ends: 455 [2025-02-07 21:14:07,853 INFO L226 Difference]: Without dead ends: 285 [2025-02-07 21:14:07,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:07,854 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 473 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:07,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 877 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-02-07 21:14:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 218. [2025-02-07 21:14:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3864734299516908) internal successors, (287), 207 states have internal predecessors, (287), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 297 transitions. [2025-02-07 21:14:07,875 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 297 transitions. Word has length 165 [2025-02-07 21:14:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:07,875 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 297 transitions. [2025-02-07 21:14:07,875 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-02-07 21:14:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 297 transitions. [2025-02-07 21:14:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:07,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:07,876 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-02-07 21:14:07,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-07 21:14:07,877 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:07,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash 868347495, now seen corresponding path program 1 times [2025-02-07 21:14:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:07,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686659857] [2025-02-07 21:14:07,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:07,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:07,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:07,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:07,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:07,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:07,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686659857] [2025-02-07 21:14:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686659857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:07,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:07,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279611366] [2025-02-07 21:14:07,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:07,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:07,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:07,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:07,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:07,926 INFO L87 Difference]: Start difference. First operand 218 states and 297 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:07,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:07,952 INFO L93 Difference]: Finished difference Result 380 states and 524 transitions. [2025-02-07 21:14:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:07,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:07,953 INFO L225 Difference]: With dead ends: 380 [2025-02-07 21:14:07,953 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:07,954 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-02-07 21:14:07,955 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:07,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 207 states have internal predecessors, (286), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 296 transitions. [2025-02-07 21:14:07,967 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 296 transitions. Word has length 165 [2025-02-07 21:14:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:07,968 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 296 transitions. [2025-02-07 21:14:07,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 296 transitions. [2025-02-07 21:14:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:07,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:07,968 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-02-07 21:14:07,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-07 21:14:07,969 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:07,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:07,969 INFO L85 PathProgramCache]: Analyzing trace with hash 44666024, now seen corresponding path program 1 times [2025-02-07 21:14:07,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:07,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203144262] [2025-02-07 21:14:07,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:07,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:07,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:07,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:07,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:07,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203144262] [2025-02-07 21:14:08,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203144262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733350788] [2025-02-07 21:14:08,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,013 INFO L87 Difference]: Start difference. First operand 218 states and 296 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,026 INFO L93 Difference]: Finished difference Result 370 states and 509 transitions. [2025-02-07 21:14:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,028 INFO L225 Difference]: With dead ends: 370 [2025-02-07 21:14:08,028 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,028 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-02-07 21:14:08,028 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3768115942028984) internal successors, (285), 207 states have internal predecessors, (285), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 295 transitions. [2025-02-07 21:14:08,039 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 295 transitions. Word has length 165 [2025-02-07 21:14:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,039 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 295 transitions. [2025-02-07 21:14:08,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 295 transitions. [2025-02-07 21:14:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,041 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-02-07 21:14:08,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-07 21:14:08,041 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1175452649, now seen corresponding path program 1 times [2025-02-07 21:14:08,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685091607] [2025-02-07 21:14:08,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685091607] [2025-02-07 21:14:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685091607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364747858] [2025-02-07 21:14:08,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,085 INFO L87 Difference]: Start difference. First operand 218 states and 295 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,097 INFO L93 Difference]: Finished difference Result 355 states and 487 transitions. [2025-02-07 21:14:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,098 INFO L225 Difference]: With dead ends: 355 [2025-02-07 21:14:08,098 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,100 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-02-07 21:14:08,102 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 0 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 207 states have internal predecessors, (284), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 294 transitions. [2025-02-07 21:14:08,117 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 294 transitions. Word has length 165 [2025-02-07 21:14:08,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,117 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 294 transitions. [2025-02-07 21:14:08,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,117 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 294 transitions. [2025-02-07 21:14:08,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,118 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-02-07 21:14:08,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-07 21:14:08,118 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash 205161642, now seen corresponding path program 1 times [2025-02-07 21:14:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539337190] [2025-02-07 21:14:08,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539337190] [2025-02-07 21:14:08,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539337190] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883974906] [2025-02-07 21:14:08,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,162 INFO L87 Difference]: Start difference. First operand 218 states and 294 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,174 INFO L93 Difference]: Finished difference Result 375 states and 512 transitions. [2025-02-07 21:14:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,175 INFO L225 Difference]: With dead ends: 375 [2025-02-07 21:14:08,175 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,175 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-02-07 21:14:08,176 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 0 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 582 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3671497584541064) internal successors, (283), 207 states have internal predecessors, (283), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 293 transitions. [2025-02-07 21:14:08,198 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 293 transitions. Word has length 165 [2025-02-07 21:14:08,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,198 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 293 transitions. [2025-02-07 21:14:08,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 293 transitions. [2025-02-07 21:14:08,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,199 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-02-07 21:14:08,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-07 21:14:08,199 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1281715051, now seen corresponding path program 1 times [2025-02-07 21:14:08,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498499561] [2025-02-07 21:14:08,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498499561] [2025-02-07 21:14:08,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498499561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120455300] [2025-02-07 21:14:08,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,254 INFO L87 Difference]: Start difference. First operand 218 states and 293 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,266 INFO L93 Difference]: Finished difference Result 365 states and 498 transitions. [2025-02-07 21:14:08,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,268 INFO L225 Difference]: With dead ends: 365 [2025-02-07 21:14:08,268 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,268 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 0 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3623188405797102) internal successors, (282), 207 states have internal predecessors, (282), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 292 transitions. [2025-02-07 21:14:08,278 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 292 transitions. Word has length 165 [2025-02-07 21:14:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,279 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 292 transitions. [2025-02-07 21:14:08,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 292 transitions. [2025-02-07 21:14:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,279 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-02-07 21:14:08,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-07 21:14:08,279 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1797235500, now seen corresponding path program 1 times [2025-02-07 21:14:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243612255] [2025-02-07 21:14:08,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243612255] [2025-02-07 21:14:08,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243612255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099559277] [2025-02-07 21:14:08,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,321 INFO L87 Difference]: Start difference. First operand 218 states and 292 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,332 INFO L93 Difference]: Finished difference Result 360 states and 490 transitions. [2025-02-07 21:14:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,334 INFO L225 Difference]: With dead ends: 360 [2025-02-07 21:14:08,334 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,334 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-02-07 21:14:08,334 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.357487922705314) internal successors, (281), 207 states have internal predecessors, (281), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 291 transitions. [2025-02-07 21:14:08,346 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 291 transitions. Word has length 165 [2025-02-07 21:14:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,346 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 291 transitions. [2025-02-07 21:14:08,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 291 transitions. [2025-02-07 21:14:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,347 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-02-07 21:14:08,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-07 21:14:08,347 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1822039187, now seen corresponding path program 1 times [2025-02-07 21:14:08,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859362754] [2025-02-07 21:14:08,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859362754] [2025-02-07 21:14:08,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859362754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231078282] [2025-02-07 21:14:08,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,395 INFO L87 Difference]: Start difference. First operand 218 states and 291 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,409 INFO L93 Difference]: Finished difference Result 335 states and 455 transitions. [2025-02-07 21:14:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,411 INFO L225 Difference]: With dead ends: 335 [2025-02-07 21:14:08,411 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,411 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-02-07 21:14:08,412 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3526570048309179) internal successors, (280), 207 states have internal predecessors, (280), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2025-02-07 21:14:08,422 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 165 [2025-02-07 21:14:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,423 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2025-02-07 21:14:08,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2025-02-07 21:14:08,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,424 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-02-07 21:14:08,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-07 21:14:08,424 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,424 INFO L85 PathProgramCache]: Analyzing trace with hash -954986962, now seen corresponding path program 1 times [2025-02-07 21:14:08,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118872613] [2025-02-07 21:14:08,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118872613] [2025-02-07 21:14:08,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118872613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218221802] [2025-02-07 21:14:08,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,471 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,483 INFO L93 Difference]: Finished difference Result 340 states and 460 transitions. [2025-02-07 21:14:08,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,485 INFO L225 Difference]: With dead ends: 340 [2025-02-07 21:14:08,485 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,486 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-02-07 21:14:08,486 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 0 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 207 states have internal predecessors, (279), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2025-02-07 21:14:08,496 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 165 [2025-02-07 21:14:08,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,496 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2025-02-07 21:14:08,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2025-02-07 21:14:08,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:14:08,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-07 21:14:08,498 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,498 INFO L85 PathProgramCache]: Analyzing trace with hash -834867089, now seen corresponding path program 1 times [2025-02-07 21:14:08,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794781769] [2025-02-07 21:14:08,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794781769] [2025-02-07 21:14:08,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794781769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513424936] [2025-02-07 21:14:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,535 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,547 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2025-02-07 21:14:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,548 INFO L225 Difference]: With dead ends: 345 [2025-02-07 21:14:08,548 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,548 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-02-07 21:14:08,549 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3429951690821256) internal successors, (278), 207 states have internal predecessors, (278), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 288 transitions. [2025-02-07 21:14:08,559 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 288 transitions. Word has length 165 [2025-02-07 21:14:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,562 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 288 transitions. [2025-02-07 21:14:08,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 288 transitions. [2025-02-07 21:14:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,563 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-02-07 21:14:08,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-07 21:14:08,564 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1975044656, now seen corresponding path program 1 times [2025-02-07 21:14:08,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408520879] [2025-02-07 21:14:08,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408520879] [2025-02-07 21:14:08,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408520879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083262154] [2025-02-07 21:14:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,605 INFO L87 Difference]: Start difference. First operand 218 states and 288 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,616 INFO L93 Difference]: Finished difference Result 330 states and 445 transitions. [2025-02-07 21:14:08,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,618 INFO L225 Difference]: With dead ends: 330 [2025-02-07 21:14:08,618 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,618 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-02-07 21:14:08,619 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 570 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3381642512077294) internal successors, (277), 207 states have internal predecessors, (277), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 287 transitions. [2025-02-07 21:14:08,629 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 287 transitions. Word has length 165 [2025-02-07 21:14:08,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,630 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 287 transitions. [2025-02-07 21:14:08,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 287 transitions. [2025-02-07 21:14:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:14:08,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-07 21:14:08,631 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1491369329, now seen corresponding path program 1 times [2025-02-07 21:14:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327856265] [2025-02-07 21:14:08,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327856265] [2025-02-07 21:14:08,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327856265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773987722] [2025-02-07 21:14:08,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,673 INFO L87 Difference]: Start difference. First operand 218 states and 287 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,691 INFO L93 Difference]: Finished difference Result 320 states and 430 transitions. [2025-02-07 21:14:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,692 INFO L225 Difference]: With dead ends: 320 [2025-02-07 21:14:08,692 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,692 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-02-07 21:14:08,693 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3333333333333333) internal successors, (276), 207 states have internal predecessors, (276), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 286 transitions. [2025-02-07 21:14:08,703 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 286 transitions. Word has length 165 [2025-02-07 21:14:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,703 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 286 transitions. [2025-02-07 21:14:08,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 286 transitions. [2025-02-07 21:14:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:14:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-07 21:14:08,705 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1282671026, now seen corresponding path program 1 times [2025-02-07 21:14:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921906384] [2025-02-07 21:14:08,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921906384] [2025-02-07 21:14:08,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921906384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:08,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961689613] [2025-02-07 21:14:08,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:08,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:08,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:08,748 INFO L87 Difference]: Start difference. First operand 218 states and 286 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,760 INFO L93 Difference]: Finished difference Result 315 states and 422 transitions. [2025-02-07 21:14:08,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:08,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,762 INFO L225 Difference]: With dead ends: 315 [2025-02-07 21:14:08,762 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,762 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-02-07 21:14:08,763 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 566 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.328502415458937) internal successors, (275), 207 states have internal predecessors, (275), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 285 transitions. [2025-02-07 21:14:08,774 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 285 transitions. Word has length 165 [2025-02-07 21:14:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:08,775 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 285 transitions. [2025-02-07 21:14:08,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,775 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 285 transitions. [2025-02-07 21:14:08,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:08,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:08,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:14:08,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-07 21:14:08,776 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:08,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:08,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1563020915, now seen corresponding path program 1 times [2025-02-07 21:14:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289002961] [2025-02-07 21:14:08,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:08,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:08,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:08,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:08,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:08,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:08,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:08,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289002961] [2025-02-07 21:14:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289002961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:08,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:08,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269508698] [2025-02-07 21:14:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:08,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:08,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:08,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:08,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:08,856 INFO L87 Difference]: Start difference. First operand 218 states and 285 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:08,993 INFO L93 Difference]: Finished difference Result 310 states and 415 transitions. [2025-02-07 21:14:08,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:08,994 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:08,995 INFO L225 Difference]: With dead ends: 310 [2025-02-07 21:14:08,995 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:08,996 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-02-07 21:14:08,996 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 418 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:08,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 429 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3236714975845412) internal successors, (274), 207 states have internal predecessors, (274), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 284 transitions. [2025-02-07 21:14:09,007 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 284 transitions. Word has length 165 [2025-02-07 21:14:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:09,010 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 284 transitions. [2025-02-07 21:14:09,010 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,010 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 284 transitions. [2025-02-07 21:14:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:09,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:09,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:14:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-07 21:14:09,011 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2001030418, now seen corresponding path program 1 times [2025-02-07 21:14:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833886875] [2025-02-07 21:14:09,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:09,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:09,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:09,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:09,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:09,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:09,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833886875] [2025-02-07 21:14:09,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833886875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:09,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164223240] [2025-02-07 21:14:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:09,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:09,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:09,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:09,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:09,060 INFO L87 Difference]: Start difference. First operand 218 states and 284 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:09,080 INFO L93 Difference]: Finished difference Result 325 states and 431 transitions. [2025-02-07 21:14:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:09,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 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-02-07 21:14:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:09,081 INFO L225 Difference]: With dead ends: 325 [2025-02-07 21:14:09,081 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:09,081 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-02-07 21:14:09,083 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:09,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:09,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.318840579710145) internal successors, (273), 207 states have internal predecessors, (273), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2025-02-07 21:14:09,107 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 165 [2025-02-07 21:14:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:09,107 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2025-02-07 21:14:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2025-02-07 21:14:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:09,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:09,108 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-02-07 21:14:09,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-07 21:14:09,108 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:09,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:09,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1392953555, now seen corresponding path program 1 times [2025-02-07 21:14:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732948336] [2025-02-07 21:14:09,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:09,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:09,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:09,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:09,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:09,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:09,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732948336] [2025-02-07 21:14:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732948336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027481160] [2025-02-07 21:14:09,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:09,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:09,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:09,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:09,232 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:09,491 INFO L93 Difference]: Finished difference Result 378 states and 494 transitions. [2025-02-07 21:14:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:09,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:09,493 INFO L225 Difference]: With dead ends: 378 [2025-02-07 21:14:09,493 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:09,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:09,493 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 547 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:09,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 537 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3140096618357489) internal successors, (272), 207 states have internal predecessors, (272), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 282 transitions. [2025-02-07 21:14:09,506 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 282 transitions. Word has length 165 [2025-02-07 21:14:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:09,507 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 282 transitions. [2025-02-07 21:14:09,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 282 transitions. [2025-02-07 21:14:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:09,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:09,507 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-02-07 21:14:09,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-07 21:14:09,508 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:09,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash -532579756, now seen corresponding path program 1 times [2025-02-07 21:14:09,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:09,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160763485] [2025-02-07 21:14:09,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:09,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:09,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:09,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:09,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:09,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:09,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160763485] [2025-02-07 21:14:09,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160763485] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:09,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:09,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:09,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491996707] [2025-02-07 21:14:09,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:09,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:09,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:09,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:09,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:09,603 INFO L87 Difference]: Start difference. First operand 218 states and 282 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:09,858 INFO L93 Difference]: Finished difference Result 377 states and 491 transitions. [2025-02-07 21:14:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:09,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:09,860 INFO L225 Difference]: With dead ends: 377 [2025-02-07 21:14:09,860 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:09,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:09,860 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 543 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:09,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 535 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3091787439613527) internal successors, (271), 207 states have internal predecessors, (271), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:09,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 281 transitions. [2025-02-07 21:14:09,871 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 281 transitions. Word has length 165 [2025-02-07 21:14:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:09,872 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 281 transitions. [2025-02-07 21:14:09,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 281 transitions. [2025-02-07 21:14:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:09,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:14:09,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-07 21:14:09,873 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:09,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash 236590259, now seen corresponding path program 1 times [2025-02-07 21:14:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:09,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887847175] [2025-02-07 21:14:09,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:09,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:09,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:09,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:09,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:09,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:09,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887847175] [2025-02-07 21:14:09,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887847175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:09,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:09,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:09,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923062428] [2025-02-07 21:14:09,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:09,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:09,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:09,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:09,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:09,960 INFO L87 Difference]: Start difference. First operand 218 states and 281 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:10,202 INFO L93 Difference]: Finished difference Result 376 states and 488 transitions. [2025-02-07 21:14:10,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:10,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:10,203 INFO L225 Difference]: With dead ends: 376 [2025-02-07 21:14:10,203 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:10,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:10,204 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 539 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:10,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 533 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.3043478260869565) internal successors, (270), 207 states have internal predecessors, (270), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 280 transitions. [2025-02-07 21:14:10,215 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 280 transitions. Word has length 165 [2025-02-07 21:14:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:10,216 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 280 transitions. [2025-02-07 21:14:10,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 280 transitions. [2025-02-07 21:14:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:10,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:10,217 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-02-07 21:14:10,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-07 21:14:10,217 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:10,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1369780852, now seen corresponding path program 1 times [2025-02-07 21:14:10,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:10,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118876522] [2025-02-07 21:14:10,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:10,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:10,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:10,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:10,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:10,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:10,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:10,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118876522] [2025-02-07 21:14:10,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118876522] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:10,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:10,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744840034] [2025-02-07 21:14:10,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:10,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:10,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:10,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:10,314 INFO L87 Difference]: Start difference. First operand 218 states and 280 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:10,551 INFO L93 Difference]: Finished difference Result 375 states and 485 transitions. [2025-02-07 21:14:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:10,553 INFO L225 Difference]: With dead ends: 375 [2025-02-07 21:14:10,553 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:10,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:10,553 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 535 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:10,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 531 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2995169082125604) internal successors, (269), 207 states have internal predecessors, (269), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 279 transitions. [2025-02-07 21:14:10,564 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 279 transitions. Word has length 165 [2025-02-07 21:14:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:10,564 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 279 transitions. [2025-02-07 21:14:10,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 279 transitions. [2025-02-07 21:14:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:10,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:10,565 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-02-07 21:14:10,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-02-07 21:14:10,565 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:10,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1129240723, now seen corresponding path program 1 times [2025-02-07 21:14:10,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:10,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725835180] [2025-02-07 21:14:10,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:10,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:10,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:10,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:10,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:10,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-02-07 21:14:10,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:10,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725835180] [2025-02-07 21:14:10,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725835180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:10,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:10,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:10,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026531517] [2025-02-07 21:14:10,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:10,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:10,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:10,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:10,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:10,630 INFO L87 Difference]: Start difference. First operand 218 states and 279 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:10,760 INFO L93 Difference]: Finished difference Result 304 states and 397 transitions. [2025-02-07 21:14:10,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:10,760 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:10,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:10,761 INFO L225 Difference]: With dead ends: 304 [2025-02-07 21:14:10,761 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:10,761 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-02-07 21:14:10,761 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 400 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:10,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 419 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:10,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2946859903381642) internal successors, (268), 207 states have internal predecessors, (268), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2025-02-07 21:14:10,773 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 165 [2025-02-07 21:14:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:10,774 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2025-02-07 21:14:10,774 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2025-02-07 21:14:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:10,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:10,774 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-02-07 21:14:10,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-07 21:14:10,775 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:10,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2098821746, now seen corresponding path program 1 times [2025-02-07 21:14:10,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869618517] [2025-02-07 21:14:10,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:10,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:10,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:10,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:10,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:10,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:10,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869618517] [2025-02-07 21:14:10,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869618517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:10,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:10,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880878853] [2025-02-07 21:14:10,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:10,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:10,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:10,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:10,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:10,846 INFO L87 Difference]: Start difference. First operand 218 states and 278 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:10,982 INFO L93 Difference]: Finished difference Result 303 states and 394 transitions. [2025-02-07 21:14:10,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:10,982 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:10,983 INFO L225 Difference]: With dead ends: 303 [2025-02-07 21:14:10,983 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:10,984 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-02-07 21:14:10,985 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 397 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:10,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 417 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.289855072463768) internal successors, (267), 207 states have internal predecessors, (267), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 277 transitions. [2025-02-07 21:14:10,996 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 277 transitions. Word has length 165 [2025-02-07 21:14:10,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:10,996 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 277 transitions. [2025-02-07 21:14:10,996 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 277 transitions. [2025-02-07 21:14:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:10,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:10,997 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-02-07 21:14:10,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-02-07 21:14:10,997 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:10,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:10,997 INFO L85 PathProgramCache]: Analyzing trace with hash -225206093, now seen corresponding path program 1 times [2025-02-07 21:14:10,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:10,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156382101] [2025-02-07 21:14:10,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:10,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:11,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:11,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156382101] [2025-02-07 21:14:11,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156382101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:11,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751847869] [2025-02-07 21:14:11,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:11,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:11,092 INFO L87 Difference]: Start difference. First operand 218 states and 277 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,295 INFO L93 Difference]: Finished difference Result 371 states and 474 transitions. [2025-02-07 21:14:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:11,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,296 INFO L225 Difference]: With dead ends: 371 [2025-02-07 21:14:11,296 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:11,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:11,297 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 522 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 525 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.285024154589372) internal successors, (266), 207 states have internal predecessors, (266), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 276 transitions. [2025-02-07 21:14:11,307 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 276 transitions. Word has length 165 [2025-02-07 21:14:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,307 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 276 transitions. [2025-02-07 21:14:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 276 transitions. [2025-02-07 21:14:11,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:11,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,308 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-02-07 21:14:11,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-07 21:14:11,308 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1408553390, now seen corresponding path program 1 times [2025-02-07 21:14:11,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641964829] [2025-02-07 21:14:11,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:11,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:11,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641964829] [2025-02-07 21:14:11,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641964829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:11,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386452587] [2025-02-07 21:14:11,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:11,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:11,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:11,372 INFO L87 Difference]: Start difference. First operand 218 states and 276 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,506 INFO L93 Difference]: Finished difference Result 301 states and 388 transitions. [2025-02-07 21:14:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:11,507 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,508 INFO L225 Difference]: With dead ends: 301 [2025-02-07 21:14:11,508 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:11,508 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-02-07 21:14:11,509 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 391 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 413 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:11,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2801932367149758) internal successors, (265), 207 states have internal predecessors, (265), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 275 transitions. [2025-02-07 21:14:11,527 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 275 transitions. Word has length 165 [2025-02-07 21:14:11,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,527 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 275 transitions. [2025-02-07 21:14:11,527 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,527 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 275 transitions. [2025-02-07 21:14:11,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:11,528 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,529 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-02-07 21:14:11,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-02-07 21:14:11,529 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1185673427, now seen corresponding path program 1 times [2025-02-07 21:14:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773329709] [2025-02-07 21:14:11,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:11,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:11,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773329709] [2025-02-07 21:14:11,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773329709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164580343] [2025-02-07 21:14:11,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:11,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:11,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:11,599 INFO L87 Difference]: Start difference. First operand 218 states and 275 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,728 INFO L93 Difference]: Finished difference Result 300 states and 385 transitions. [2025-02-07 21:14:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:11,729 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,729 INFO L225 Difference]: With dead ends: 300 [2025-02-07 21:14:11,729 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:11,730 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-02-07 21:14:11,730 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 388 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 411 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:11,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2753623188405796) internal successors, (264), 207 states have internal predecessors, (264), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 274 transitions. [2025-02-07 21:14:11,740 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 274 transitions. Word has length 165 [2025-02-07 21:14:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,740 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 274 transitions. [2025-02-07 21:14:11,740 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 274 transitions. [2025-02-07 21:14:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:11,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,741 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-02-07 21:14:11,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-07 21:14:11,741 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,741 INFO L85 PathProgramCache]: Analyzing trace with hash 160979506, now seen corresponding path program 1 times [2025-02-07 21:14:11,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240359392] [2025-02-07 21:14:11,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:11,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:11,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:11,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240359392] [2025-02-07 21:14:11,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240359392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:11,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:11,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020696749] [2025-02-07 21:14:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:11,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:11,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:11,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:11,805 INFO L87 Difference]: Start difference. First operand 218 states and 274 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:11,926 INFO L93 Difference]: Finished difference Result 299 states and 382 transitions. [2025-02-07 21:14:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:11,927 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:11,928 INFO L225 Difference]: With dead ends: 299 [2025-02-07 21:14:11,928 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:11,928 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-02-07 21:14:11,928 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 385 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:11,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 409 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2705314009661837) internal successors, (263), 207 states have internal predecessors, (263), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 273 transitions. [2025-02-07 21:14:11,938 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 273 transitions. Word has length 165 [2025-02-07 21:14:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:11,939 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 273 transitions. [2025-02-07 21:14:11,939 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 273 transitions. [2025-02-07 21:14:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:11,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:11,939 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-02-07 21:14:11,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-07 21:14:11,939 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:11,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash -287717133, now seen corresponding path program 1 times [2025-02-07 21:14:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102070141] [2025-02-07 21:14:11,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:11,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:11,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:11,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:11,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102070141] [2025-02-07 21:14:12,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102070141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:12,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19641890] [2025-02-07 21:14:12,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:12,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:12,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:12,039 INFO L87 Difference]: Start difference. First operand 218 states and 273 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,245 INFO L93 Difference]: Finished difference Result 367 states and 462 transitions. [2025-02-07 21:14:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,246 INFO L225 Difference]: With dead ends: 367 [2025-02-07 21:14:12,246 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:12,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:12,247 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 506 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 517 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:12,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2657004830917875) internal successors, (262), 207 states have internal predecessors, (262), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 272 transitions. [2025-02-07 21:14:12,257 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 272 transitions. Word has length 165 [2025-02-07 21:14:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,257 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 272 transitions. [2025-02-07 21:14:12,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 272 transitions. [2025-02-07 21:14:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:12,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,258 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-02-07 21:14:12,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-02-07 21:14:12,258 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,258 INFO L85 PathProgramCache]: Analyzing trace with hash -163643886, now seen corresponding path program 1 times [2025-02-07 21:14:12,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088111217] [2025-02-07 21:14:12,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:12,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:12,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088111217] [2025-02-07 21:14:12,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088111217] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:12,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456575675] [2025-02-07 21:14:12,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:12,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:12,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:12,344 INFO L87 Difference]: Start difference. First operand 218 states and 272 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,574 INFO L93 Difference]: Finished difference Result 365 states and 457 transitions. [2025-02-07 21:14:12,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:12,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,575 INFO L225 Difference]: With dead ends: 365 [2025-02-07 21:14:12,575 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:12,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:12,576 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 500 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 515 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:12,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2608695652173914) internal successors, (261), 207 states have internal predecessors, (261), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 271 transitions. [2025-02-07 21:14:12,586 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 271 transitions. Word has length 165 [2025-02-07 21:14:12,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,587 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 271 transitions. [2025-02-07 21:14:12,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 271 transitions. [2025-02-07 21:14:12,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:12,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,587 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-02-07 21:14:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-02-07 21:14:12,587 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1297936113, now seen corresponding path program 1 times [2025-02-07 21:14:12,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765011643] [2025-02-07 21:14:12,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:12,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:12,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765011643] [2025-02-07 21:14:12,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765011643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:12,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820897930] [2025-02-07 21:14:12,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:12,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:12,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:12,664 INFO L87 Difference]: Start difference. First operand 218 states and 271 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,791 INFO L93 Difference]: Finished difference Result 295 states and 371 transitions. [2025-02-07 21:14:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:12,792 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,792 INFO L225 Difference]: With dead ends: 295 [2025-02-07 21:14:12,792 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:12,793 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-02-07 21:14:12,793 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 375 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 403 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 207 states have internal predecessors, (260), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 270 transitions. [2025-02-07 21:14:12,803 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 270 transitions. Word has length 165 [2025-02-07 21:14:12,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,803 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 270 transitions. [2025-02-07 21:14:12,803 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,803 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 270 transitions. [2025-02-07 21:14:12,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:12,804 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:12,804 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-02-07 21:14:12,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-02-07 21:14:12,804 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:12,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash 375252530, now seen corresponding path program 1 times [2025-02-07 21:14:12,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:12,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526072938] [2025-02-07 21:14:12,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:12,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:12,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:12,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:12,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526072938] [2025-02-07 21:14:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526072938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:12,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:12,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809706883] [2025-02-07 21:14:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:12,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:12,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:12,869 INFO L87 Difference]: Start difference. First operand 218 states and 270 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:12,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:12,987 INFO L93 Difference]: Finished difference Result 294 states and 368 transitions. [2025-02-07 21:14:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:12,988 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:12,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:12,988 INFO L225 Difference]: With dead ends: 294 [2025-02-07 21:14:12,988 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:12,989 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-02-07 21:14:12,989 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 372 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:12,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 401 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:12,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.251207729468599) internal successors, (259), 207 states have internal predecessors, (259), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 269 transitions. [2025-02-07 21:14:12,999 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 269 transitions. Word has length 165 [2025-02-07 21:14:12,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:12,999 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 269 transitions. [2025-02-07 21:14:13,000 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 269 transitions. [2025-02-07 21:14:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:13,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,001 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-02-07 21:14:13,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-02-07 21:14:13,001 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2008056529, now seen corresponding path program 1 times [2025-02-07 21:14:13,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513667139] [2025-02-07 21:14:13,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:13,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:13,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:13,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513667139] [2025-02-07 21:14:13,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513667139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:13,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687751817] [2025-02-07 21:14:13,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:13,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:13,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:13,098 INFO L87 Difference]: Start difference. First operand 218 states and 269 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,304 INFO L93 Difference]: Finished difference Result 362 states and 448 transitions. [2025-02-07 21:14:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,305 INFO L225 Difference]: With dead ends: 362 [2025-02-07 21:14:13,305 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:13,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:13,306 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 488 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:13,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 509 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2463768115942029) internal successors, (258), 207 states have internal predecessors, (258), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 268 transitions. [2025-02-07 21:14:13,316 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 268 transitions. Word has length 165 [2025-02-07 21:14:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,316 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 268 transitions. [2025-02-07 21:14:13,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 268 transitions. [2025-02-07 21:14:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:13,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,317 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-02-07 21:14:13,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-02-07 21:14:13,317 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1957145006, now seen corresponding path program 1 times [2025-02-07 21:14:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648598111] [2025-02-07 21:14:13,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:13,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:13,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:13,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648598111] [2025-02-07 21:14:13,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648598111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:13,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570388912] [2025-02-07 21:14:13,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:13,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:13,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:13,380 INFO L87 Difference]: Start difference. First operand 218 states and 268 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,497 INFO L93 Difference]: Finished difference Result 292 states and 362 transitions. [2025-02-07 21:14:13,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:13,498 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,498 INFO L225 Difference]: With dead ends: 292 [2025-02-07 21:14:13,498 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:13,499 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-02-07 21:14:13,499 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 366 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:13,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 397 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2415458937198067) internal successors, (257), 207 states have internal predecessors, (257), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 267 transitions. [2025-02-07 21:14:13,510 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 267 transitions. Word has length 165 [2025-02-07 21:14:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,510 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 267 transitions. [2025-02-07 21:14:13,510 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 267 transitions. [2025-02-07 21:14:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:13,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,510 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-02-07 21:14:13,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-02-07 21:14:13,511 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash -6844751, now seen corresponding path program 1 times [2025-02-07 21:14:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152998359] [2025-02-07 21:14:13,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:13,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:13,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:13,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152998359] [2025-02-07 21:14:13,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152998359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945758498] [2025-02-07 21:14:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:13,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:13,613 INFO L87 Difference]: Start difference. First operand 218 states and 267 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:13,848 INFO L93 Difference]: Finished difference Result 360 states and 442 transitions. [2025-02-07 21:14:13,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:13,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:13,850 INFO L225 Difference]: With dead ends: 360 [2025-02-07 21:14:13,850 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:13,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:13,850 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 480 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:13,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 505 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2367149758454106) internal successors, (256), 207 states have internal predecessors, (256), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 266 transitions. [2025-02-07 21:14:13,869 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 266 transitions. Word has length 165 [2025-02-07 21:14:13,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:13,870 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 266 transitions. [2025-02-07 21:14:13,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 266 transitions. [2025-02-07 21:14:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:13,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:13,870 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-02-07 21:14:13,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-02-07 21:14:13,871 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:13,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1718636146, now seen corresponding path program 1 times [2025-02-07 21:14:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:13,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309877825] [2025-02-07 21:14:13,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:13,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:13,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:13,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:13,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:13,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:13,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:13,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309877825] [2025-02-07 21:14:13,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309877825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:13,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374138213] [2025-02-07 21:14:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:13,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:13,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:13,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:13,983 INFO L87 Difference]: Start difference. First operand 218 states and 266 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,234 INFO L93 Difference]: Finished difference Result 359 states and 439 transitions. [2025-02-07 21:14:14,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:14,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,236 INFO L225 Difference]: With dead ends: 359 [2025-02-07 21:14:14,236 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:14,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:14,236 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 476 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 503 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2318840579710144) internal successors, (255), 207 states have internal predecessors, (255), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 265 transitions. [2025-02-07 21:14:14,248 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 265 transitions. Word has length 165 [2025-02-07 21:14:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,249 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 265 transitions. [2025-02-07 21:14:14,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 265 transitions. [2025-02-07 21:14:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:14,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:14:14,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-02-07 21:14:14,250 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1550839151, now seen corresponding path program 1 times [2025-02-07 21:14:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069619716] [2025-02-07 21:14:14,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:14,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:14,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:14,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069619716] [2025-02-07 21:14:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069619716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049646597] [2025-02-07 21:14:14,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:14,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:14,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,320 INFO L87 Difference]: Start difference. First operand 218 states and 265 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,447 INFO L93 Difference]: Finished difference Result 288 states and 351 transitions. [2025-02-07 21:14:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:14,448 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:14,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,448 INFO L225 Difference]: With dead ends: 288 [2025-02-07 21:14:14,448 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:14,449 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-02-07 21:14:14,449 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 356 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 391 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:14,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2270531400966183) internal successors, (254), 207 states have internal predecessors, (254), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2025-02-07 21:14:14,459 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 165 [2025-02-07 21:14:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,460 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2025-02-07 21:14:14,460 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2025-02-07 21:14:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:14,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,461 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-02-07 21:14:14,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-02-07 21:14:14,461 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash 734024304, now seen corresponding path program 1 times [2025-02-07 21:14:14,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395388454] [2025-02-07 21:14:14,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:14,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:14,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395388454] [2025-02-07 21:14:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395388454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453203285] [2025-02-07 21:14:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:14,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:14,543 INFO L87 Difference]: Start difference. First operand 218 states and 264 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:14,676 INFO L93 Difference]: Finished difference Result 287 states and 348 transitions. [2025-02-07 21:14:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:14:14,677 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:14,678 INFO L225 Difference]: With dead ends: 287 [2025-02-07 21:14:14,678 INFO L226 Difference]: Without dead ends: 218 [2025-02-07 21:14:14,678 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-02-07 21:14:14,678 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 353 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:14,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 389 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:14,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-02-07 21:14:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-02-07 21:14:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2222222222222223) internal successors, (253), 207 states have internal predecessors, (253), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 263 transitions. [2025-02-07 21:14:14,691 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 263 transitions. Word has length 165 [2025-02-07 21:14:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:14,691 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 263 transitions. [2025-02-07 21:14:14,691 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 263 transitions. [2025-02-07 21:14:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:14,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:14,692 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-02-07 21:14:14,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-02-07 21:14:14,692 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:14,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1084824241, now seen corresponding path program 1 times [2025-02-07 21:14:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:14,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196419577] [2025-02-07 21:14:14,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:14,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:14,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:14,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:14,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:14,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:14,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196419577] [2025-02-07 21:14:14,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196419577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:14,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:14,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:14,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532992098] [2025-02-07 21:14:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:14,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:14,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:14,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:14,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:14,804 INFO L87 Difference]: Start difference. First operand 218 states and 263 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,033 INFO L93 Difference]: Finished difference Result 355 states and 428 transitions. [2025-02-07 21:14:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:15,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,034 INFO L225 Difference]: With dead ends: 355 [2025-02-07 21:14:15,034 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:15,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:15,035 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 463 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 497 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.2173913043478262) internal successors, (252), 207 states have internal predecessors, (252), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2025-02-07 21:14:15,049 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 165 [2025-02-07 21:14:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2025-02-07 21:14:15,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2025-02-07 21:14:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:15,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,050 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-02-07 21:14:15,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-02-07 21:14:15,050 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:15,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:15,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1096140368, now seen corresponding path program 1 times [2025-02-07 21:14:15,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:15,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317941647] [2025-02-07 21:14:15,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:15,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:15,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:15,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:15,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317941647] [2025-02-07 21:14:15,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317941647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 21:14:15,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433703676] [2025-02-07 21:14:15,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:14:15,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:14:15,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:14:15,136 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,374 INFO L93 Difference]: Finished difference Result 354 states and 425 transitions. [2025-02-07 21:14:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:14:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,376 INFO L225 Difference]: With dead ends: 354 [2025-02-07 21:14:15,376 INFO L226 Difference]: Without dead ends: 287 [2025-02-07 21:14:15,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-07 21:14:15,376 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 459 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 495 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:14:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-07 21:14:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-02-07 21:14:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 207 states have (on average 1.21256038647343) internal successors, (251), 207 states have internal predecessors, (251), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 261 transitions. [2025-02-07 21:14:15,393 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 261 transitions. Word has length 165 [2025-02-07 21:14:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,393 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 261 transitions. [2025-02-07 21:14:15,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 261 transitions. [2025-02-07 21:14:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:15,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,394 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-02-07 21:14:15,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-02-07 21:14:15,395 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1789242065, now seen corresponding path program 1 times [2025-02-07 21:14:15,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:15,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505869775] [2025-02-07 21:14:15,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:15,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:15,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:15,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:15,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505869775] [2025-02-07 21:14:15,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505869775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 21:14:15,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118062628] [2025-02-07 21:14:15,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 21:14:15,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 21:14:15,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:14:15,455 INFO L87 Difference]: Start difference. First operand 218 states and 261 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), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,610 INFO L93 Difference]: Finished difference Result 432 states and 518 transitions. [2025-02-07 21:14:15,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 21:14:15,610 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), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,611 INFO L225 Difference]: With dead ends: 432 [2025-02-07 21:14:15,611 INFO L226 Difference]: Without dead ends: 216 [2025-02-07 21:14:15,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 21:14:15,612 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 590 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 683 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:14:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-02-07 21:14:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-02-07 21:14:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 205 states have (on average 1.2048780487804878) internal successors, (247), 205 states have internal predecessors, (247), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 21:14:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 257 transitions. [2025-02-07 21:14:15,622 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 257 transitions. Word has length 165 [2025-02-07 21:14:15,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,622 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 257 transitions. [2025-02-07 21:14:15,622 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), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 257 transitions. [2025-02-07 21:14:15,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-07 21:14:15,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:14:15,623 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-02-07 21:14:15,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-02-07 21:14:15,623 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:14:15,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:14:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1396243120, now seen corresponding path program 1 times [2025-02-07 21:14:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:14:15,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796700748] [2025-02-07 21:14:15,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:14:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:14:15,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-07 21:14:15,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-07 21:14:15,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:14:15,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:14:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:14:15,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:14:15,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796700748] [2025-02-07 21:14:15,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796700748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:14:15,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:14:15,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:14:15,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647937933] [2025-02-07 21:14:15,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:14:15,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:14:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:14:15,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:14:15,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:14:15,648 INFO L87 Difference]: Start difference. First operand 216 states and 257 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:14:15,650 INFO L93 Difference]: Finished difference Result 216 states and 257 transitions. [2025-02-07 21:14:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:14:15,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 165 [2025-02-07 21:14:15,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:14:15,650 INFO L225 Difference]: With dead ends: 216 [2025-02-07 21:14:15,650 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:14:15,651 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-02-07 21:14:15,651 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:14:15,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:14:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:14:15,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:14:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:14:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:14:15,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2025-02-07 21:14:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:14:15,651 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:14:15,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 21:14:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:14:15,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:14:15,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 21:14:15,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-02-07 21:14:15,656 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-07 21:14:15,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:15:03,708 WARN L286 SmtUtils]: Spent 48.05s on a formula simplification. DAG size of input: 197 DAG size of output: 166 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-07 21:15:15,845 WARN L286 SmtUtils]: Spent 12.14s on a formula simplification. DAG size of input: 133 DAG size of output: 107 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)