./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:36:05,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:36:05,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:36:05,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:36:05,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:36:05,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:36:05,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:36:05,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:36:05,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:36:05,418 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:36:05,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:36:05,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:36:05,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:36:05,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:36:05,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:36:05,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:36:05,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:36:05,420 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 [2025-03-08 07:36:05,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:36:05,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:36:05,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:36:05,691 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:36:05,691 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:36:05,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2025-03-08 07:36:06,862 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0f83c93/cbe2a547421542af9331003ed3c8acef/FLAG8464b8dd6 [2025-03-08 07:36:07,148 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:36:07,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2025-03-08 07:36:07,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0f83c93/cbe2a547421542af9331003ed3c8acef/FLAG8464b8dd6 [2025-03-08 07:36:07,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0f83c93/cbe2a547421542af9331003ed3c8acef [2025-03-08 07:36:07,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:36:07,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:36:07,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:36:07,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:36:07,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:36:07,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@385bc50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07, skipping insertion in model container [2025-03-08 07:36:07,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:36:07,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c[911,924] [2025-03-08 07:36:07,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c[8416,8429] [2025-03-08 07:36:07,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:36:07,795 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:36:07,804 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c[911,924] [2025-03-08 07:36:07,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c[8416,8429] [2025-03-08 07:36:07,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:36:07,873 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:36:07,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07 WrapperNode [2025-03-08 07:36:07,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:36:07,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:36:07,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:36:07,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:36:07,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,934 INFO L138 Inliner]: procedures = 79, calls = 98, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1053 [2025-03-08 07:36:07,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:36:07,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:36:07,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:36:07,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:36:07,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,958 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,978 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:36:07,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,987 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:07,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:08,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:36:08,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:36:08,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:36:08,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:36:08,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (1/1) ... [2025-03-08 07:36:08,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:36:08,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:36:08,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:36:08,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:36:08,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:36:08,050 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:36:08,050 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:36:08,050 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:36:08,050 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:36:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:36:08,051 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:36:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:36:08,051 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:36:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:36:08,051 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:36:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:36:08,051 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:36:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:36:08,051 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:36:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:36:08,051 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:36:08,051 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:36:08,052 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:36:08,052 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:36:08,052 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:36:08,052 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:36:08,052 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:36:08,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:36:08,052 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:36:08,052 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:36:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:36:08,053 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:36:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:36:08,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:36:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:36:08,053 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:36:08,053 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-08 07:36:08,053 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-08 07:36:08,179 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:36:08,181 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:36:08,836 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-08 07:36:08,836 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-08 07:36:08,836 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-08 07:36:09,001 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-03-08 07:36:09,001 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:36:09,022 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:36:09,024 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:36:09,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:36:09 BoogieIcfgContainer [2025-03-08 07:36:09,024 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:36:09,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:36:09,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:36:09,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:36:09,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:36:07" (1/3) ... [2025-03-08 07:36:09,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3794b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:36:09, skipping insertion in model container [2025-03-08 07:36:09,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:36:07" (2/3) ... [2025-03-08 07:36:09,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d3794b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:36:09, skipping insertion in model container [2025-03-08 07:36:09,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:36:09" (3/3) ... [2025-03-08 07:36:09,031 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.14.cil.c [2025-03-08 07:36:09,043 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:36:09,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.14.cil.c that has 16 procedures, 499 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-03-08 07:36:09,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:36:09,108 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;@5f97b613, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:36:09,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:36:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 499 states, 439 states have (on average 1.5990888382687927) internal successors, (702), 445 states have internal predecessors, (702), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 07:36:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:36:09,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:09,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:09,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1578213173, now seen corresponding path program 1 times [2025-03-08 07:36:09,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:09,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275625288] [2025-03-08 07:36:09,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:09,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:36:09,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:36:09,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:09,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:09,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275625288] [2025-03-08 07:36:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275625288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:09,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349364456] [2025-03-08 07:36:09,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:09,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:09,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:09,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:09,556 INFO L87 Difference]: Start difference. First operand has 499 states, 439 states have (on average 1.5990888382687927) internal successors, (702), 445 states have internal predecessors, (702), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:10,383 INFO L93 Difference]: Finished difference Result 1084 states and 1711 transitions. [2025-03-08 07:36:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:36:10,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-03-08 07:36:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:10,402 INFO L225 Difference]: With dead ends: 1084 [2025-03-08 07:36:10,402 INFO L226 Difference]: Without dead ends: 603 [2025-03-08 07:36:10,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:10,408 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 517 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:10,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1596 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-08 07:36:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 596. [2025-03-08 07:36:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 515 states have (on average 1.5417475728155339) internal successors, (794), 522 states have internal predecessors, (794), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2025-03-08 07:36:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 909 transitions. [2025-03-08 07:36:10,494 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 909 transitions. Word has length 63 [2025-03-08 07:36:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:10,496 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 909 transitions. [2025-03-08 07:36:10,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 909 transitions. [2025-03-08 07:36:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:36:10,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:10,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:10,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:36:10,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:10,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1712529771, now seen corresponding path program 1 times [2025-03-08 07:36:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:10,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769219043] [2025-03-08 07:36:10,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:10,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:36:10,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:36:10,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:10,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:10,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:10,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769219043] [2025-03-08 07:36:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769219043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:10,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:10,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:10,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563943551] [2025-03-08 07:36:10,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:10,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:10,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:10,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:10,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:10,683 INFO L87 Difference]: Start difference. First operand 596 states and 909 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:11,552 INFO L93 Difference]: Finished difference Result 951 states and 1412 transitions. [2025-03-08 07:36:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:11,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-03-08 07:36:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:11,556 INFO L225 Difference]: With dead ends: 951 [2025-03-08 07:36:11,556 INFO L226 Difference]: Without dead ends: 750 [2025-03-08 07:36:11,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:11,558 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 1095 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:11,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 1841 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:36:11,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-08 07:36:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 704. [2025-03-08 07:36:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 601 states have (on average 1.524126455906822) internal successors, (916), 610 states have internal predecessors, (916), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2025-03-08 07:36:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1065 transitions. [2025-03-08 07:36:11,593 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1065 transitions. Word has length 63 [2025-03-08 07:36:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:11,593 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1065 transitions. [2025-03-08 07:36:11,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:11,593 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1065 transitions. [2025-03-08 07:36:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:36:11,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:11,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:11,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:36:11,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:11,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1720289130, now seen corresponding path program 1 times [2025-03-08 07:36:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:11,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792451136] [2025-03-08 07:36:11,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:11,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:11,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:36:11,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:36:11,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:11,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:11,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:11,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792451136] [2025-03-08 07:36:11,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792451136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:11,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:11,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:36:11,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297710628] [2025-03-08 07:36:11,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:11,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:36:11,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:11,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:36:11,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:36:11,707 INFO L87 Difference]: Start difference. First operand 704 states and 1065 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:36:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:12,831 INFO L93 Difference]: Finished difference Result 2080 states and 3043 transitions. [2025-03-08 07:36:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:36:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 63 [2025-03-08 07:36:12,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:12,840 INFO L225 Difference]: With dead ends: 2080 [2025-03-08 07:36:12,840 INFO L226 Difference]: Without dead ends: 1759 [2025-03-08 07:36:12,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:36:12,842 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 3356 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3374 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:12,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3374 Valid, 2031 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:36:12,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2025-03-08 07:36:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1712. [2025-03-08 07:36:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1404 states have (on average 1.4351851851851851) internal successors, (2015), 1428 states have internal predecessors, (2015), 180 states have call successors, (180), 112 states have call predecessors, (180), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2025-03-08 07:36:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2407 transitions. [2025-03-08 07:36:12,958 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2407 transitions. Word has length 63 [2025-03-08 07:36:12,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:12,959 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2407 transitions. [2025-03-08 07:36:12,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:36:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2407 transitions. [2025-03-08 07:36:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:36:12,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:12,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:12,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:36:12,962 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:12,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:12,964 INFO L85 PathProgramCache]: Analyzing trace with hash -832508791, now seen corresponding path program 1 times [2025-03-08 07:36:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:12,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581398455] [2025-03-08 07:36:12,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:12,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:12,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:36:12,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:36:12,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:12,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:13,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:13,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581398455] [2025-03-08 07:36:13,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581398455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:13,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:13,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061977920] [2025-03-08 07:36:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:13,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:13,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:13,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:13,048 INFO L87 Difference]: Start difference. First operand 1712 states and 2407 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:36:13,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:13,129 INFO L93 Difference]: Finished difference Result 3075 states and 4275 transitions. [2025-03-08 07:36:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:36:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-08 07:36:13,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:13,136 INFO L225 Difference]: With dead ends: 3075 [2025-03-08 07:36:13,136 INFO L226 Difference]: Without dead ends: 1752 [2025-03-08 07:36:13,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:13,138 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 0 mSDsluCounter, 3002 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:13,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3754 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-03-08 07:36:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2025-03-08 07:36:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1436 states have (on average 1.4213091922005572) internal successors, (2041), 1460 states have internal predecessors, (2041), 180 states have call successors, (180), 112 states have call predecessors, (180), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2025-03-08 07:36:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2441 transitions. [2025-03-08 07:36:13,207 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2441 transitions. Word has length 64 [2025-03-08 07:36:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:13,207 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2441 transitions. [2025-03-08 07:36:13,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:36:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2441 transitions. [2025-03-08 07:36:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:36:13,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:13,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:13,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:36:13,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:13,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:13,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1117791464, now seen corresponding path program 1 times [2025-03-08 07:36:13,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:13,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214218232] [2025-03-08 07:36:13,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:13,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:36:13,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:36:13,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:13,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:13,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214218232] [2025-03-08 07:36:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214218232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:13,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:36:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510398308] [2025-03-08 07:36:13,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:13,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:36:13,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:13,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:36:13,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:36:13,314 INFO L87 Difference]: Start difference. First operand 1752 states and 2441 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:36:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:14,466 INFO L93 Difference]: Finished difference Result 4971 states and 6858 transitions. [2025-03-08 07:36:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:36:14,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2025-03-08 07:36:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:14,475 INFO L225 Difference]: With dead ends: 4971 [2025-03-08 07:36:14,476 INFO L226 Difference]: Without dead ends: 2040 [2025-03-08 07:36:14,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:36:14,482 INFO L435 NwaCegarLoop]: 497 mSDtfsCounter, 3385 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3403 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:14,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3403 Valid, 2072 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:36:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2025-03-08 07:36:14,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1970. [2025-03-08 07:36:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1582 states have (on average 1.3742098609355247) internal successors, (2174), 1608 states have internal predecessors, (2174), 220 states have call successors, (220), 140 states have call predecessors, (220), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2025-03-08 07:36:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2660 transitions. [2025-03-08 07:36:14,578 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2660 transitions. Word has length 64 [2025-03-08 07:36:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:14,579 INFO L471 AbstractCegarLoop]: Abstraction has 1970 states and 2660 transitions. [2025-03-08 07:36:14,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:36:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2660 transitions. [2025-03-08 07:36:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:14,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:14,580 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:14,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:36:14,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:14,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:14,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1323189720, now seen corresponding path program 1 times [2025-03-08 07:36:14,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:14,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452009903] [2025-03-08 07:36:14,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:14,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:14,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:14,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:14,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:14,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:36:14,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:14,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452009903] [2025-03-08 07:36:14,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452009903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:14,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:14,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151933223] [2025-03-08 07:36:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:14,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:14,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:14,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:14,666 INFO L87 Difference]: Start difference. First operand 1970 states and 2660 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:36:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:14,740 INFO L93 Difference]: Finished difference Result 3611 states and 4813 transitions. [2025-03-08 07:36:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:36:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2025-03-08 07:36:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:14,750 INFO L225 Difference]: With dead ends: 3611 [2025-03-08 07:36:14,750 INFO L226 Difference]: Without dead ends: 2030 [2025-03-08 07:36:14,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:14,755 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 0 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3715 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:14,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3715 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:14,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2025-03-08 07:36:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2030. [2025-03-08 07:36:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 1630 states have (on average 1.3595092024539877) internal successors, (2216), 1656 states have internal predecessors, (2216), 220 states have call successors, (220), 140 states have call predecessors, (220), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2025-03-08 07:36:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2714 transitions. [2025-03-08 07:36:14,852 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2714 transitions. Word has length 86 [2025-03-08 07:36:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:14,852 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2714 transitions. [2025-03-08 07:36:14,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:36:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2714 transitions. [2025-03-08 07:36:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:14,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:14,853 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:14,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:36:14,853 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:14,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash -353608697, now seen corresponding path program 1 times [2025-03-08 07:36:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:14,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593798293] [2025-03-08 07:36:14,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:14,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:14,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:14,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:14,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:36:14,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:14,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593798293] [2025-03-08 07:36:14,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593798293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:14,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:14,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807698335] [2025-03-08 07:36:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:14,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:14,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:14,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:14,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:14,983 INFO L87 Difference]: Start difference. First operand 2030 states and 2714 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:15,787 INFO L93 Difference]: Finished difference Result 3436 states and 4511 transitions. [2025-03-08 07:36:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:36:15,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2025-03-08 07:36:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:15,798 INFO L225 Difference]: With dead ends: 3436 [2025-03-08 07:36:15,798 INFO L226 Difference]: Without dead ends: 2026 [2025-03-08 07:36:15,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:15,802 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 1096 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:15,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 1618 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2025-03-08 07:36:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 1816. [2025-03-08 07:36:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1469 states have (on average 1.3648740639891082) internal successors, (2005), 1490 states have internal predecessors, (2005), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2025-03-08 07:36:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2435 transitions. [2025-03-08 07:36:15,912 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2435 transitions. Word has length 86 [2025-03-08 07:36:15,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:15,913 INFO L471 AbstractCegarLoop]: Abstraction has 1816 states and 2435 transitions. [2025-03-08 07:36:15,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2435 transitions. [2025-03-08 07:36:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:15,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:15,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:15,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:36:15,916 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:15,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:15,916 INFO L85 PathProgramCache]: Analyzing trace with hash -802305336, now seen corresponding path program 1 times [2025-03-08 07:36:15,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:15,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166127922] [2025-03-08 07:36:15,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:15,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:15,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:15,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:15,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:36:15,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:15,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166127922] [2025-03-08 07:36:15,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166127922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:15,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:15,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:36:15,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338709021] [2025-03-08 07:36:15,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:15,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:36:15,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:15,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:36:15,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:36:15,985 INFO L87 Difference]: Start difference. First operand 1816 states and 2435 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:36:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:16,550 INFO L93 Difference]: Finished difference Result 4668 states and 6165 transitions. [2025-03-08 07:36:16,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:36:16,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2025-03-08 07:36:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:16,567 INFO L225 Difference]: With dead ends: 4668 [2025-03-08 07:36:16,567 INFO L226 Difference]: Without dead ends: 3242 [2025-03-08 07:36:16,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:16,572 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 1027 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:16,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 817 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:36:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2025-03-08 07:36:16,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3242. [2025-03-08 07:36:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3242 states, 2575 states have (on average 1.316504854368932) internal successors, (3390), 2625 states have internal predecessors, (3390), 353 states have call successors, (353), 234 states have call predecessors, (353), 312 states have return successors, (521), 385 states have call predecessors, (521), 349 states have call successors, (521) [2025-03-08 07:36:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 4264 transitions. [2025-03-08 07:36:16,708 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 4264 transitions. Word has length 86 [2025-03-08 07:36:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:16,709 INFO L471 AbstractCegarLoop]: Abstraction has 3242 states and 4264 transitions. [2025-03-08 07:36:16,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:36:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 4264 transitions. [2025-03-08 07:36:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:16,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:16,710 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:16,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:36:16,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:16,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash 306509863, now seen corresponding path program 1 times [2025-03-08 07:36:16,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:16,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477335545] [2025-03-08 07:36:16,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:16,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:16,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:16,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:16,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:16,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:36:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:16,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477335545] [2025-03-08 07:36:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477335545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:16,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:36:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291599406] [2025-03-08 07:36:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:16,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:36:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:16,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:36:16,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:36:16,752 INFO L87 Difference]: Start difference. First operand 3242 states and 4264 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:16,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:16,814 INFO L93 Difference]: Finished difference Result 4668 states and 6045 transitions. [2025-03-08 07:36:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:36:16,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2025-03-08 07:36:16,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:16,824 INFO L225 Difference]: With dead ends: 4668 [2025-03-08 07:36:16,824 INFO L226 Difference]: Without dead ends: 1816 [2025-03-08 07:36:16,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:36:16,830 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 137 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:16,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1344 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2025-03-08 07:36:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1816. [2025-03-08 07:36:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1469 states have (on average 1.3396868618107556) internal successors, (1968), 1490 states have internal predecessors, (1968), 192 states have call successors, (192), 121 states have call predecessors, (192), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2025-03-08 07:36:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2398 transitions. [2025-03-08 07:36:16,899 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2398 transitions. Word has length 86 [2025-03-08 07:36:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:16,899 INFO L471 AbstractCegarLoop]: Abstraction has 1816 states and 2398 transitions. [2025-03-08 07:36:16,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2398 transitions. [2025-03-08 07:36:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 07:36:16,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:16,901 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:16,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:36:16,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:16,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 577498693, now seen corresponding path program 1 times [2025-03-08 07:36:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:16,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213732060] [2025-03-08 07:36:16,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:16,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:36:16,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:36:16,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:16,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:36:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213732060] [2025-03-08 07:36:17,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213732060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:17,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:36:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311782640] [2025-03-08 07:36:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:17,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:36:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:17,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:36:17,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:36:17,002 INFO L87 Difference]: Start difference. First operand 1816 states and 2398 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:36:18,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:18,069 INFO L93 Difference]: Finished difference Result 4101 states and 5315 transitions. [2025-03-08 07:36:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:36:18,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-08 07:36:18,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:18,082 INFO L225 Difference]: With dead ends: 4101 [2025-03-08 07:36:18,082 INFO L226 Difference]: Without dead ends: 2528 [2025-03-08 07:36:18,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:36:18,087 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 1737 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 2137 SdHoareTripleChecker+Invalid, 2122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:18,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 2137 Invalid, 2122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:36:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-03-08 07:36:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2407. [2025-03-08 07:36:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 1914 states have (on average 1.2993730407523512) internal successors, (2487), 1944 states have internal predecessors, (2487), 263 states have call successors, (263), 171 states have call predecessors, (263), 228 states have return successors, (343), 293 states have call predecessors, (343), 259 states have call successors, (343) [2025-03-08 07:36:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 3093 transitions. [2025-03-08 07:36:18,250 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 3093 transitions. Word has length 87 [2025-03-08 07:36:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:18,251 INFO L471 AbstractCegarLoop]: Abstraction has 2407 states and 3093 transitions. [2025-03-08 07:36:18,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:36:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 3093 transitions. [2025-03-08 07:36:18,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 07:36:18,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:18,254 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:18,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:36:18,254 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:18,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash 213552913, now seen corresponding path program 1 times [2025-03-08 07:36:18,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:18,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799459664] [2025-03-08 07:36:18,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:18,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 07:36:18,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 07:36:18,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:18,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 07:36:18,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799459664] [2025-03-08 07:36:18,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799459664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:36:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987422356] [2025-03-08 07:36:18,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:18,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:36:18,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:36:18,390 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:36:18,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:36:18,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 07:36:18,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 07:36:18,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:18,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:18,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:36:18,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:36:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 07:36:18,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:36:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987422356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:18,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:36:18,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:36:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574075605] [2025-03-08 07:36:18,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:18,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:36:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:18,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:36:18,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:18,622 INFO L87 Difference]: Start difference. First operand 2407 states and 3093 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:36:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:18,786 INFO L93 Difference]: Finished difference Result 6220 states and 7774 transitions. [2025-03-08 07:36:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:36:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 156 [2025-03-08 07:36:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:18,801 INFO L225 Difference]: With dead ends: 6220 [2025-03-08 07:36:18,801 INFO L226 Difference]: Without dead ends: 4276 [2025-03-08 07:36:18,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:18,806 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 61 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:18,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1468 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2025-03-08 07:36:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4244. [2025-03-08 07:36:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4244 states, 3334 states have (on average 1.2621475704859029) internal successors, (4208), 3389 states have internal predecessors, (4208), 470 states have call successors, (470), 334 states have call predecessors, (470), 438 states have return successors, (606), 522 states have call predecessors, (606), 466 states have call successors, (606) [2025-03-08 07:36:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4244 states to 4244 states and 5284 transitions. [2025-03-08 07:36:18,999 INFO L78 Accepts]: Start accepts. Automaton has 4244 states and 5284 transitions. Word has length 156 [2025-03-08 07:36:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:18,999 INFO L471 AbstractCegarLoop]: Abstraction has 4244 states and 5284 transitions. [2025-03-08 07:36:18,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:36:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4244 states and 5284 transitions. [2025-03-08 07:36:19,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:36:19,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:19,001 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:19,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:36:19,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 07:36:19,202 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:19,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:19,203 INFO L85 PathProgramCache]: Analyzing trace with hash -470042143, now seen corresponding path program 1 times [2025-03-08 07:36:19,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:19,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735928414] [2025-03-08 07:36:19,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:19,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:19,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:36:19,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:36:19,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:19,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 07:36:19,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735928414] [2025-03-08 07:36:19,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735928414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:36:19,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872755577] [2025-03-08 07:36:19,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:19,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:36:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:36:19,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:36:19,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:36:19,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:36:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:36:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:19,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:19,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:36:19,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:36:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 07:36:19,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:36:19,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872755577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:19,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:36:19,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:36:19,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677432889] [2025-03-08 07:36:19,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:19,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:36:19,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:19,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:36:19,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:19,684 INFO L87 Difference]: Start difference. First operand 4244 states and 5284 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 07:36:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:20,008 INFO L93 Difference]: Finished difference Result 11952 states and 14620 transitions. [2025-03-08 07:36:20,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:36:20,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 188 [2025-03-08 07:36:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:20,038 INFO L225 Difference]: With dead ends: 11952 [2025-03-08 07:36:20,039 INFO L226 Difference]: Without dead ends: 8098 [2025-03-08 07:36:20,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:20,048 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 52 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:20,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1467 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8098 states. [2025-03-08 07:36:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8098 to 8088. [2025-03-08 07:36:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8088 states, 6310 states have (on average 1.2377179080824088) internal successors, (7810), 6415 states have internal predecessors, (7810), 906 states have call successors, (906), 660 states have call predecessors, (906), 870 states have return successors, (1182), 1014 states have call predecessors, (1182), 902 states have call successors, (1182) [2025-03-08 07:36:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8088 states to 8088 states and 9898 transitions. [2025-03-08 07:36:20,433 INFO L78 Accepts]: Start accepts. Automaton has 8088 states and 9898 transitions. Word has length 188 [2025-03-08 07:36:20,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:20,434 INFO L471 AbstractCegarLoop]: Abstraction has 8088 states and 9898 transitions. [2025-03-08 07:36:20,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 07:36:20,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8088 states and 9898 transitions. [2025-03-08 07:36:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-08 07:36:20,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:20,437 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:20,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:36:20,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 07:36:20,638 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:20,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 991537856, now seen corresponding path program 1 times [2025-03-08 07:36:20,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:20,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389203128] [2025-03-08 07:36:20,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:20,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:20,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:36:20,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:36:20,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:20,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 07:36:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389203128] [2025-03-08 07:36:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389203128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:36:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419780085] [2025-03-08 07:36:20,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:36:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:36:20,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:36:20,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:36:20,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 07:36:20,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 07:36:20,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:20,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:20,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:36:20,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:36:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-08 07:36:21,079 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:36:21,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419780085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:21,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:36:21,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:36:21,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976491554] [2025-03-08 07:36:21,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:21,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:36:21,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:21,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:36:21,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:21,081 INFO L87 Difference]: Start difference. First operand 8088 states and 9898 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 07:36:21,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:21,345 INFO L93 Difference]: Finished difference Result 14408 states and 17856 transitions. [2025-03-08 07:36:21,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:36:21,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 188 [2025-03-08 07:36:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:21,354 INFO L225 Difference]: With dead ends: 14408 [2025-03-08 07:36:21,355 INFO L226 Difference]: Without dead ends: 381 [2025-03-08 07:36:21,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:21,374 INFO L435 NwaCegarLoop]: 727 mSDtfsCounter, 626 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:21,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 727 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-08 07:36:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-03-08 07:36:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 346 states have (on average 1.583815028901734) internal successors, (548), 348 states have internal predecessors, (548), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 07:36:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2025-03-08 07:36:21,389 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 188 [2025-03-08 07:36:21,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:21,389 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2025-03-08 07:36:21,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 07:36:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2025-03-08 07:36:21,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:21,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:21,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:21,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:36:21,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:36:21,592 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:21,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash 841017663, now seen corresponding path program 1 times [2025-03-08 07:36:21,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:21,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212318229] [2025-03-08 07:36:21,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:21,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:21,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:21,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:21,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:21,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:21,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:21,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212318229] [2025-03-08 07:36:21,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212318229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:21,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:21,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:36:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687993335] [2025-03-08 07:36:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:21,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:36:21,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:21,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:36:21,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:36:21,646 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:21,656 INFO L93 Difference]: Finished difference Result 750 states and 1185 transitions. [2025-03-08 07:36:21,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:36:21,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:21,663 INFO L225 Difference]: With dead ends: 750 [2025-03-08 07:36:21,663 INFO L226 Difference]: Without dead ends: 381 [2025-03-08 07:36:21,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:36:21,664 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 590 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:21,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 601 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-08 07:36:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-03-08 07:36:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 346 states have (on average 1.5809248554913296) internal successors, (547), 348 states have internal predecessors, (547), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 07:36:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 601 transitions. [2025-03-08 07:36:21,676 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 601 transitions. Word has length 177 [2025-03-08 07:36:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:21,678 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 601 transitions. [2025-03-08 07:36:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 601 transitions. [2025-03-08 07:36:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:21,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:21,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:21,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:36:21,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:21,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:21,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1703321824, now seen corresponding path program 1 times [2025-03-08 07:36:21,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:21,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706710847] [2025-03-08 07:36:21,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:21,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:21,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:21,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:21,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:21,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:21,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706710847] [2025-03-08 07:36:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706710847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:21,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:21,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491996075] [2025-03-08 07:36:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:21,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:21,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:21,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:21,767 INFO L87 Difference]: Start difference. First operand 381 states and 601 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:22,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:22,275 INFO L93 Difference]: Finished difference Result 1149 states and 1831 transitions. [2025-03-08 07:36:22,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:36:22,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:22,282 INFO L225 Difference]: With dead ends: 1149 [2025-03-08 07:36:22,283 INFO L226 Difference]: Without dead ends: 789 [2025-03-08 07:36:22,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:22,286 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 1159 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:22,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1658 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:36:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-08 07:36:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 758. [2025-03-08 07:36:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 695 states have (on average 1.5928057553956834) internal successors, (1107), 698 states have internal predecessors, (1107), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-08 07:36:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1204 transitions. [2025-03-08 07:36:22,320 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1204 transitions. Word has length 177 [2025-03-08 07:36:22,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:22,320 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1204 transitions. [2025-03-08 07:36:22,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1204 transitions. [2025-03-08 07:36:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:22,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:22,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:22,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:36:22,323 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:22,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:22,323 INFO L85 PathProgramCache]: Analyzing trace with hash 372993374, now seen corresponding path program 1 times [2025-03-08 07:36:22,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:22,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845623904] [2025-03-08 07:36:22,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:22,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:22,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:22,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:22,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:22,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:22,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:22,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845623904] [2025-03-08 07:36:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845623904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:22,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:22,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470440789] [2025-03-08 07:36:22,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:22,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:22,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:22,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:22,481 INFO L87 Difference]: Start difference. First operand 758 states and 1204 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:23,193 INFO L93 Difference]: Finished difference Result 1980 states and 3182 transitions. [2025-03-08 07:36:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:23,201 INFO L225 Difference]: With dead ends: 1980 [2025-03-08 07:36:23,202 INFO L226 Difference]: Without dead ends: 1243 [2025-03-08 07:36:23,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:23,204 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 1168 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 3205 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:23,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 3205 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-03-08 07:36:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1108. [2025-03-08 07:36:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1017 states have (on average 1.5860373647984267) internal successors, (1613), 1021 states have internal predecessors, (1613), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-03-08 07:36:23,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1755 transitions. [2025-03-08 07:36:23,252 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1755 transitions. Word has length 177 [2025-03-08 07:36:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:23,252 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1755 transitions. [2025-03-08 07:36:23,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1755 transitions. [2025-03-08 07:36:23,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:23,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:23,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:23,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:36:23,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:23,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:23,255 INFO L85 PathProgramCache]: Analyzing trace with hash -329602465, now seen corresponding path program 1 times [2025-03-08 07:36:23,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:23,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251117678] [2025-03-08 07:36:23,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:23,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:23,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:23,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:23,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:23,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:23,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251117678] [2025-03-08 07:36:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251117678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:23,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:23,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:23,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555819930] [2025-03-08 07:36:23,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:23,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:23,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:23,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:23,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:23,386 INFO L87 Difference]: Start difference. First operand 1108 states and 1755 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:24,118 INFO L93 Difference]: Finished difference Result 3100 states and 4974 transitions. [2025-03-08 07:36:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:24,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:24,132 INFO L225 Difference]: With dead ends: 3100 [2025-03-08 07:36:24,132 INFO L226 Difference]: Without dead ends: 2013 [2025-03-08 07:36:24,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:24,135 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1163 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 3189 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:24,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 3189 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:24,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2025-03-08 07:36:24,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1857. [2025-03-08 07:36:24,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1708 states have (on average 1.5901639344262295) internal successors, (2716), 1716 states have internal predecessors, (2716), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-03-08 07:36:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2954 transitions. [2025-03-08 07:36:24,183 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2954 transitions. Word has length 177 [2025-03-08 07:36:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:24,184 INFO L471 AbstractCegarLoop]: Abstraction has 1857 states and 2954 transitions. [2025-03-08 07:36:24,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2954 transitions. [2025-03-08 07:36:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:24,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:24,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:24,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:36:24,187 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:24,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:24,187 INFO L85 PathProgramCache]: Analyzing trace with hash 617564478, now seen corresponding path program 1 times [2025-03-08 07:36:24,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:24,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049802622] [2025-03-08 07:36:24,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:24,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:24,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:24,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:24,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:24,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:24,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049802622] [2025-03-08 07:36:24,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049802622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:24,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:24,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:24,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921810738] [2025-03-08 07:36:24,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:24,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:24,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:24,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:24,291 INFO L87 Difference]: Start difference. First operand 1857 states and 2954 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:24,927 INFO L93 Difference]: Finished difference Result 5531 states and 8943 transitions. [2025-03-08 07:36:24,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:24,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:24,941 INFO L225 Difference]: With dead ends: 5531 [2025-03-08 07:36:24,942 INFO L226 Difference]: Without dead ends: 3695 [2025-03-08 07:36:24,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:24,946 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 1158 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 3177 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:24,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 3177 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:36:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2025-03-08 07:36:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3496. [2025-03-08 07:36:25,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3225 states have (on average 1.6074418604651164) internal successors, (5184), 3247 states have internal predecessors, (5184), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-03-08 07:36:25,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 5638 transitions. [2025-03-08 07:36:25,033 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 5638 transitions. Word has length 177 [2025-03-08 07:36:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:25,033 INFO L471 AbstractCegarLoop]: Abstraction has 3496 states and 5638 transitions. [2025-03-08 07:36:25,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 5638 transitions. [2025-03-08 07:36:25,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:25,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:25,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:25,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:36:25,036 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:25,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:25,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1340854911, now seen corresponding path program 1 times [2025-03-08 07:36:25,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:25,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131861883] [2025-03-08 07:36:25,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:25,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:25,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:25,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:25,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:25,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:25,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:25,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131861883] [2025-03-08 07:36:25,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131861883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:25,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:25,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:25,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725037268] [2025-03-08 07:36:25,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:25,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:25,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:25,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:25,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:25,143 INFO L87 Difference]: Start difference. First operand 3496 states and 5638 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:25,877 INFO L93 Difference]: Finished difference Result 10938 states and 18013 transitions. [2025-03-08 07:36:25,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:25,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:25,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:25,906 INFO L225 Difference]: With dead ends: 10938 [2025-03-08 07:36:25,906 INFO L226 Difference]: Without dead ends: 7463 [2025-03-08 07:36:25,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:25,916 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 1153 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 3165 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:25,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 3165 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:25,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2025-03-08 07:36:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 7179. [2025-03-08 07:36:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7179 states, 6646 states have (on average 1.635871200722239) internal successors, (10872), 6714 states have internal predecessors, (10872), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-08 07:36:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7179 states to 7179 states and 11854 transitions. [2025-03-08 07:36:26,119 INFO L78 Accepts]: Start accepts. Automaton has 7179 states and 11854 transitions. Word has length 177 [2025-03-08 07:36:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:26,119 INFO L471 AbstractCegarLoop]: Abstraction has 7179 states and 11854 transitions. [2025-03-08 07:36:26,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 11854 transitions. [2025-03-08 07:36:26,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:26,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:26,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:26,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:36:26,123 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:26,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1268212450, now seen corresponding path program 1 times [2025-03-08 07:36:26,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:26,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587420109] [2025-03-08 07:36:26,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:26,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:26,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:26,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:26,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:26,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:26,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587420109] [2025-03-08 07:36:26,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587420109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:26,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:26,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:26,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693300469] [2025-03-08 07:36:26,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:26,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:26,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:26,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:26,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:26,218 INFO L87 Difference]: Start difference. First operand 7179 states and 11854 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:26,685 INFO L93 Difference]: Finished difference Result 16163 states and 27368 transitions. [2025-03-08 07:36:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:26,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:26,718 INFO L225 Difference]: With dead ends: 16163 [2025-03-08 07:36:26,718 INFO L226 Difference]: Without dead ends: 9005 [2025-03-08 07:36:26,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:26,738 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 816 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:26,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 1185 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:36:26,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9005 states. [2025-03-08 07:36:26,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9005 to 7179. [2025-03-08 07:36:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7179 states, 6646 states have (on average 1.6333132711405356) internal successors, (10855), 6714 states have internal predecessors, (10855), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-08 07:36:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7179 states to 7179 states and 11837 transitions. [2025-03-08 07:36:26,995 INFO L78 Accepts]: Start accepts. Automaton has 7179 states and 11837 transitions. Word has length 177 [2025-03-08 07:36:26,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:26,995 INFO L471 AbstractCegarLoop]: Abstraction has 7179 states and 11837 transitions. [2025-03-08 07:36:26,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 11837 transitions. [2025-03-08 07:36:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:26,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:26,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:26,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:36:26,999 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:27,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1075281249, now seen corresponding path program 1 times [2025-03-08 07:36:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:27,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772724466] [2025-03-08 07:36:27,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:27,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:27,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:27,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:27,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:27,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:27,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772724466] [2025-03-08 07:36:27,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772724466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:27,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:27,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:27,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533129320] [2025-03-08 07:36:27,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:27,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:27,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:27,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:27,091 INFO L87 Difference]: Start difference. First operand 7179 states and 11837 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:27,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:27,541 INFO L93 Difference]: Finished difference Result 16080 states and 27168 transitions. [2025-03-08 07:36:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:27,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:27,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:27,629 INFO L225 Difference]: With dead ends: 16080 [2025-03-08 07:36:27,629 INFO L226 Difference]: Without dead ends: 8922 [2025-03-08 07:36:27,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:27,638 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 813 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:27,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1177 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:36:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8922 states. [2025-03-08 07:36:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8922 to 7179. [2025-03-08 07:36:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7179 states, 6646 states have (on average 1.6307553415588323) internal successors, (10838), 6714 states have internal predecessors, (10838), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-08 07:36:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7179 states to 7179 states and 11820 transitions. [2025-03-08 07:36:27,837 INFO L78 Accepts]: Start accepts. Automaton has 7179 states and 11820 transitions. Word has length 177 [2025-03-08 07:36:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:27,837 INFO L471 AbstractCegarLoop]: Abstraction has 7179 states and 11820 transitions. [2025-03-08 07:36:27,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 11820 transitions. [2025-03-08 07:36:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:27,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:27,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:27,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:36:27,841 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1207604994, now seen corresponding path program 1 times [2025-03-08 07:36:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012958176] [2025-03-08 07:36:27,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:27,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:27,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:27,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:27,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:27,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012958176] [2025-03-08 07:36:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012958176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:27,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:27,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:27,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836733036] [2025-03-08 07:36:27,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:27,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:27,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:27,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:27,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:27,931 INFO L87 Difference]: Start difference. First operand 7179 states and 11820 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:28,463 INFO L93 Difference]: Finished difference Result 15997 states and 26968 transitions. [2025-03-08 07:36:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:28,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:28,495 INFO L225 Difference]: With dead ends: 15997 [2025-03-08 07:36:28,495 INFO L226 Difference]: Without dead ends: 8839 [2025-03-08 07:36:28,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:28,509 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 810 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:28,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 1169 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:36:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2025-03-08 07:36:28,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 7179. [2025-03-08 07:36:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7179 states, 6646 states have (on average 1.6281974119771292) internal successors, (10821), 6714 states have internal predecessors, (10821), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-08 07:36:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7179 states to 7179 states and 11803 transitions. [2025-03-08 07:36:28,888 INFO L78 Accepts]: Start accepts. Automaton has 7179 states and 11803 transitions. Word has length 177 [2025-03-08 07:36:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:28,888 INFO L471 AbstractCegarLoop]: Abstraction has 7179 states and 11803 transitions. [2025-03-08 07:36:28,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 11803 transitions. [2025-03-08 07:36:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:28,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:28,892 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:28,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:36:28,892 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:28,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:28,892 INFO L85 PathProgramCache]: Analyzing trace with hash -242042177, now seen corresponding path program 1 times [2025-03-08 07:36:28,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:28,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52212107] [2025-03-08 07:36:28,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:28,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:28,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:28,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:28,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:28,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:28,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52212107] [2025-03-08 07:36:28,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52212107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:28,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:28,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:28,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430667377] [2025-03-08 07:36:28,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:28,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:28,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:28,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:28,996 INFO L87 Difference]: Start difference. First operand 7179 states and 11803 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:29,883 INFO L93 Difference]: Finished difference Result 23013 states and 38774 transitions. [2025-03-08 07:36:29,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:29,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:29,935 INFO L225 Difference]: With dead ends: 23013 [2025-03-08 07:36:29,935 INFO L226 Difference]: Without dead ends: 15855 [2025-03-08 07:36:29,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:29,953 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 1124 mSDsluCounter, 2335 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:29,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 3096 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:36:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15855 states. [2025-03-08 07:36:30,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15855 to 15463. [2025-03-08 07:36:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15463 states, 14352 states have (on average 1.659350613154961) internal successors, (23815), 14566 states have internal predecessors, (23815), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-08 07:36:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15463 states to 15463 states and 26237 transitions. [2025-03-08 07:36:30,486 INFO L78 Accepts]: Start accepts. Automaton has 15463 states and 26237 transitions. Word has length 177 [2025-03-08 07:36:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:30,486 INFO L471 AbstractCegarLoop]: Abstraction has 15463 states and 26237 transitions. [2025-03-08 07:36:30,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 15463 states and 26237 transitions. [2025-03-08 07:36:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:30,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:30,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:30,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:36:30,491 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:30,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:30,492 INFO L85 PathProgramCache]: Analyzing trace with hash -903631650, now seen corresponding path program 1 times [2025-03-08 07:36:30,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:30,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117754804] [2025-03-08 07:36:30,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:30,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:30,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:30,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:30,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:30,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:30,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:30,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117754804] [2025-03-08 07:36:30,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117754804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:30,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:30,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453968492] [2025-03-08 07:36:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:30,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:30,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:30,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:30,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:30,559 INFO L87 Difference]: Start difference. First operand 15463 states and 26237 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:31,284 INFO L93 Difference]: Finished difference Result 35315 states and 61616 transitions. [2025-03-08 07:36:31,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:31,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:31,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:31,346 INFO L225 Difference]: With dead ends: 35315 [2025-03-08 07:36:31,346 INFO L226 Difference]: Without dead ends: 19873 [2025-03-08 07:36:31,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:31,372 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 806 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:31,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1155 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:36:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19873 states. [2025-03-08 07:36:31,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19873 to 15463. [2025-03-08 07:36:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15463 states, 14352 states have (on average 1.6570512820512822) internal successors, (23782), 14566 states have internal predecessors, (23782), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-08 07:36:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15463 states to 15463 states and 26204 transitions. [2025-03-08 07:36:32,036 INFO L78 Accepts]: Start accepts. Automaton has 15463 states and 26204 transitions. Word has length 177 [2025-03-08 07:36:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:32,037 INFO L471 AbstractCegarLoop]: Abstraction has 15463 states and 26204 transitions. [2025-03-08 07:36:32,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 15463 states and 26204 transitions. [2025-03-08 07:36:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:32,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:32,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:32,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:36:32,043 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:32,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash 44858079, now seen corresponding path program 1 times [2025-03-08 07:36:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:32,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745369374] [2025-03-08 07:36:32,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:32,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:32,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:32,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:32,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745369374] [2025-03-08 07:36:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745369374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195553123] [2025-03-08 07:36:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:32,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:32,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:32,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:32,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:32,156 INFO L87 Difference]: Start difference. First operand 15463 states and 26204 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:33,984 INFO L93 Difference]: Finished difference Result 50691 states and 88663 transitions. [2025-03-08 07:36:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:34,097 INFO L225 Difference]: With dead ends: 50691 [2025-03-08 07:36:34,098 INFO L226 Difference]: Without dead ends: 35249 [2025-03-08 07:36:34,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:34,135 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 1111 mSDsluCounter, 2312 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 3065 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:34,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 3065 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35249 states. [2025-03-08 07:36:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35249 to 34623. [2025-03-08 07:36:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34623 states, 32194 states have (on average 1.6903770888985525) internal successors, (54420), 32862 states have internal predecessors, (54420), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-08 07:36:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34623 states to 34623 states and 61258 transitions. [2025-03-08 07:36:35,333 INFO L78 Accepts]: Start accepts. Automaton has 34623 states and 61258 transitions. Word has length 177 [2025-03-08 07:36:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:35,333 INFO L471 AbstractCegarLoop]: Abstraction has 34623 states and 61258 transitions. [2025-03-08 07:36:35,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 34623 states and 61258 transitions. [2025-03-08 07:36:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:35,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:35,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:35,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 07:36:35,342 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:35,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:35,342 INFO L85 PathProgramCache]: Analyzing trace with hash 214001854, now seen corresponding path program 1 times [2025-03-08 07:36:35,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:35,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889853717] [2025-03-08 07:36:35,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:35,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:35,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:35,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:35,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889853717] [2025-03-08 07:36:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889853717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:35,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:35,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819322099] [2025-03-08 07:36:35,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:35,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:35,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:35,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:35,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:35,431 INFO L87 Difference]: Start difference. First operand 34623 states and 61258 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:38,670 INFO L93 Difference]: Finished difference Result 116181 states and 214499 transitions. [2025-03-08 07:36:38,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:38,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:39,062 INFO L225 Difference]: With dead ends: 116181 [2025-03-08 07:36:39,063 INFO L226 Difference]: Without dead ends: 81579 [2025-03-08 07:36:39,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:39,183 INFO L435 NwaCegarLoop]: 750 mSDtfsCounter, 1106 mSDsluCounter, 2303 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:39,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 3053 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:36:39,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81579 states. [2025-03-08 07:36:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81579 to 80476. [2025-03-08 07:36:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80476 states, 74925 states have (on average 1.725352018685352) internal successors, (129272), 76987 states have internal predecessors, (129272), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-03-08 07:36:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80476 states to 80476 states and 151086 transitions. [2025-03-08 07:36:42,615 INFO L78 Accepts]: Start accepts. Automaton has 80476 states and 151086 transitions. Word has length 177 [2025-03-08 07:36:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:42,615 INFO L471 AbstractCegarLoop]: Abstraction has 80476 states and 151086 transitions. [2025-03-08 07:36:42,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 80476 states and 151086 transitions. [2025-03-08 07:36:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:42,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:42,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:42,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 07:36:42,632 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:42,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1720204545, now seen corresponding path program 1 times [2025-03-08 07:36:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:42,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956221056] [2025-03-08 07:36:42,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:42,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:42,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:42,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:42,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956221056] [2025-03-08 07:36:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956221056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:42,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503791669] [2025-03-08 07:36:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:42,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:42,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:42,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:42,702 INFO L87 Difference]: Start difference. First operand 80476 states and 151086 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:47,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:47,220 INFO L93 Difference]: Finished difference Result 193766 states and 377884 transitions. [2025-03-08 07:36:47,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:47,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:36:47,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:47,684 INFO L225 Difference]: With dead ends: 193766 [2025-03-08 07:36:47,684 INFO L226 Difference]: Without dead ends: 113311 [2025-03-08 07:36:47,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:47,902 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 801 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:47,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1135 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:36:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113311 states. [2025-03-08 07:36:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113311 to 80476. [2025-03-08 07:36:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80476 states, 74925 states have (on average 1.7236302969636303) internal successors, (129143), 76987 states have internal predecessors, (129143), 2716 states have call successors, (2716), 775 states have call predecessors, (2716), 2834 states have return successors, (19098), 2841 states have call predecessors, (19098), 2714 states have call successors, (19098) [2025-03-08 07:36:53,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80476 states to 80476 states and 150957 transitions. [2025-03-08 07:36:53,839 INFO L78 Accepts]: Start accepts. Automaton has 80476 states and 150957 transitions. Word has length 177 [2025-03-08 07:36:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:53,839 INFO L471 AbstractCegarLoop]: Abstraction has 80476 states and 150957 transitions. [2025-03-08 07:36:53,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 80476 states and 150957 transitions. [2025-03-08 07:36:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 07:36:53,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:53,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:53,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 07:36:53,854 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:53,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:53,855 INFO L85 PathProgramCache]: Analyzing trace with hash 157064350, now seen corresponding path program 1 times [2025-03-08 07:36:53,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:53,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774994364] [2025-03-08 07:36:53,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:53,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:53,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 07:36:53,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 07:36:53,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:53,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774994364] [2025-03-08 07:36:53,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774994364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:53,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:53,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976109310] [2025-03-08 07:36:53,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:53,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:53,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:53,929 INFO L87 Difference]: Start difference. First operand 80476 states and 150957 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:37:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:37:00,182 INFO L93 Difference]: Finished difference Result 284848 states and 560703 transitions. [2025-03-08 07:37:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:37:00,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 177 [2025-03-08 07:37:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:37:00,853 INFO L225 Difference]: With dead ends: 284848 [2025-03-08 07:37:00,853 INFO L226 Difference]: Without dead ends: 204393 [2025-03-08 07:37:01,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:37:01,015 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1467 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:37:01,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 3009 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:37:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204393 states.