./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/Problem05_label42+token_ring.08.cil-1.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 aa38d95315e187ea5fe9b62230d938985648af7e7d892502233db02121b7b545 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:57:21,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:57:21,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:57:21,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:57:21,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:57:21,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:57:21,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:57:21,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:57:21,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:57:21,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:57:21,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:57:21,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:57:21,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:57:21,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:57:21,890 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:57:21,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:57:21,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:57:21,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:57:21,892 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:57:21,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:57:21,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:57:21,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:57:21,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:57:21,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:57:21,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:57:21,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:57:21,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:57:21,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:57:21,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:57:21,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:57:21,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:57:21,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:57:21,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:57:21,893 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 -> aa38d95315e187ea5fe9b62230d938985648af7e7d892502233db02121b7b545 [2025-03-16 19:57:22,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:57:22,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:57:22,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:57:22,116 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:57:22,116 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:57:22,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.08.cil-1.c [2025-03-16 19:57:23,294 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1fe6a66/2a761365969b44d29dfa83194a0e2de8/FLAGb8796b535 [2025-03-16 19:57:23,758 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:57:23,759 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.08.cil-1.c [2025-03-16 19:57:23,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1fe6a66/2a761365969b44d29dfa83194a0e2de8/FLAGb8796b535 [2025-03-16 19:57:23,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b1fe6a66/2a761365969b44d29dfa83194a0e2de8 [2025-03-16 19:57:23,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:57:23,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:57:23,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:57:23,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:57:23,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:57:23,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:57:23" (1/1) ... [2025-03-16 19:57:23,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76882b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:23, skipping insertion in model container [2025-03-16 19:57:23,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:57:23" (1/1) ... [2025-03-16 19:57:23,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:57:25,020 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/Problem05_label42+token_ring.08.cil-1.c[378560,378573] [2025-03-16 19:57:25,048 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/Problem05_label42+token_ring.08.cil-1.c[383339,383352] [2025-03-16 19:57:25,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:57:25,247 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:57:25,732 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/Problem05_label42+token_ring.08.cil-1.c[378560,378573] [2025-03-16 19:57:25,737 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/Problem05_label42+token_ring.08.cil-1.c[383339,383352] [2025-03-16 19:57:25,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:57:25,801 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:57:25,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25 WrapperNode [2025-03-16 19:57:25,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:57:25,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:57:25,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:57:25,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:57:25,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:25,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,252 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-03-16 19:57:26,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:57:26,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:57:26,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:57:26,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:57:26,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,405 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-16 19:57:26,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,548 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:57:26,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:57:26,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:57:26,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:57:26,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (1/1) ... [2025-03-16 19:57:26,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:57:26,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:57:26,694 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-16 19:57:26,700 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-16 19:57:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:57:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:57:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:57:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:57:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:57:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:57:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:57:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:57:26,826 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:57:26,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:57:32,670 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:57:32,671 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:57:32,671 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:57:32,671 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:57:32,672 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:57:32,672 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:57:32,672 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:57:32,861 INFO L? ?]: Removed 1720 outVars from TransFormulas that were not future-live. [2025-03-16 19:57:32,862 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:57:32,913 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:57:32,913 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:57:32,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:57:32 BoogieIcfgContainer [2025-03-16 19:57:32,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:57:32,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:57:32,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:57:32,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:57:32,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:57:23" (1/3) ... [2025-03-16 19:57:32,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190c7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:57:32, skipping insertion in model container [2025-03-16 19:57:32,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:25" (2/3) ... [2025-03-16 19:57:32,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190c7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:57:32, skipping insertion in model container [2025-03-16 19:57:32,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:57:32" (3/3) ... [2025-03-16 19:57:32,923 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.08.cil-1.c [2025-03-16 19:57:32,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:57:32,936 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.08.cil-1.c that has 7 procedures, 2388 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-16 19:57:33,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:57:33,046 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;@7d5156a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:57:33,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:57:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 2388 states, 2358 states have (on average 1.8702290076335877) internal successors, (4410), 2360 states have internal predecessors, (4410), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 19:57:33,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:33,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:33,067 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] [2025-03-16 19:57:33,068 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:33,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:33,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1165894761, now seen corresponding path program 1 times [2025-03-16 19:57:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:33,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848235065] [2025-03-16 19:57:33,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:33,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:33,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:33,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:33,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:33,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:33,365 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-16 19:57:33,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:33,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848235065] [2025-03-16 19:57:33,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848235065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:33,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:33,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:57:33,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710382522] [2025-03-16 19:57:33,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:33,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:57:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:33,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:57:33,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:57:33,394 INFO L87 Difference]: Start difference. First operand has 2388 states, 2358 states have (on average 1.8702290076335877) internal successors, (4410), 2360 states have internal predecessors, (4410), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:33,536 INFO L93 Difference]: Finished difference Result 4770 states and 8894 transitions. [2025-03-16 19:57:33,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:57:33,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:33,560 INFO L225 Difference]: With dead ends: 4770 [2025-03-16 19:57:33,561 INFO L226 Difference]: Without dead ends: 2383 [2025-03-16 19:57:33,569 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-16 19:57:33,571 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 412 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 8341 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-16 19:57:33,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 8341 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:57:33,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-16 19:57:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2383. [2025-03-16 19:57:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2353 states have (on average 1.839779005524862) internal successors, (4329), 2355 states have internal predecessors, (4329), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 19:57:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 4373 transitions. [2025-03-16 19:57:33,671 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 4373 transitions. Word has length 121 [2025-03-16 19:57:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:33,672 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 4373 transitions. [2025-03-16 19:57:33,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 4373 transitions. [2025-03-16 19:57:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:33,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:33,675 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] [2025-03-16 19:57:33,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:57:33,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:33,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash -342213290, now seen corresponding path program 1 times [2025-03-16 19:57:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:33,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079641961] [2025-03-16 19:57:33,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:33,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:33,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:33,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:33,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:33,903 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-16 19:57:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:33,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079641961] [2025-03-16 19:57:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079641961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:33,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:33,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:33,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113165889] [2025-03-16 19:57:33,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:33,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:33,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:33,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:33,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:33,905 INFO L87 Difference]: Start difference. First operand 2383 states and 4373 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:34,415 INFO L93 Difference]: Finished difference Result 2912 states and 5222 transitions. [2025-03-16 19:57:34,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:57:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:34,428 INFO L225 Difference]: With dead ends: 2912 [2025-03-16 19:57:34,429 INFO L226 Difference]: Without dead ends: 2664 [2025-03-16 19:57:34,430 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-16 19:57:34,431 INFO L435 NwaCegarLoop]: 4284 mSDtfsCounter, 4738 mSDsluCounter, 8740 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 13024 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:34,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 13024 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-03-16 19:57:34,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2643. [2025-03-16 19:57:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2589 states have (on average 1.8188489764387794) internal successors, (4709), 2592 states have internal predecessors, (4709), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 19:57:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4788 transitions. [2025-03-16 19:57:34,502 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4788 transitions. Word has length 121 [2025-03-16 19:57:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:34,502 INFO L471 AbstractCegarLoop]: Abstraction has 2643 states and 4788 transitions. [2025-03-16 19:57:34,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4788 transitions. [2025-03-16 19:57:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:34,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:34,505 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] [2025-03-16 19:57:34,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:57:34,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:34,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2077914614, now seen corresponding path program 1 times [2025-03-16 19:57:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:34,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596587691] [2025-03-16 19:57:34,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:34,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:34,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:34,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:34,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:34,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:34,723 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-16 19:57:34,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:34,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596587691] [2025-03-16 19:57:34,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596587691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:34,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:34,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:34,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133137214] [2025-03-16 19:57:34,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:34,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:34,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:34,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:34,726 INFO L87 Difference]: Start difference. First operand 2643 states and 4788 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:35,035 INFO L93 Difference]: Finished difference Result 3205 states and 5700 transitions. [2025-03-16 19:57:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:35,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:35,045 INFO L225 Difference]: With dead ends: 3205 [2025-03-16 19:57:35,045 INFO L226 Difference]: Without dead ends: 2697 [2025-03-16 19:57:35,047 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-16 19:57:35,048 INFO L435 NwaCegarLoop]: 4274 mSDtfsCounter, 4512 mSDsluCounter, 8433 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4528 SdHoareTripleChecker+Valid, 12707 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:35,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4528 Valid, 12707 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-03-16 19:57:35,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2643. [2025-03-16 19:57:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2589 states have (on average 1.8180764774044031) internal successors, (4707), 2592 states have internal predecessors, (4707), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 19:57:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4786 transitions. [2025-03-16 19:57:35,112 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4786 transitions. Word has length 121 [2025-03-16 19:57:35,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:35,112 INFO L471 AbstractCegarLoop]: Abstraction has 2643 states and 4786 transitions. [2025-03-16 19:57:35,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4786 transitions. [2025-03-16 19:57:35,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:35,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:35,114 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] [2025-03-16 19:57:35,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:57:35,114 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:35,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:35,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1086266057, now seen corresponding path program 1 times [2025-03-16 19:57:35,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:35,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931686220] [2025-03-16 19:57:35,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:35,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:35,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:35,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:35,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:35,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:35,303 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-16 19:57:35,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:35,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931686220] [2025-03-16 19:57:35,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931686220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:35,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:35,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779253579] [2025-03-16 19:57:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:35,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:35,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:35,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:35,304 INFO L87 Difference]: Start difference. First operand 2643 states and 4786 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:35,919 INFO L93 Difference]: Finished difference Result 3480 states and 6133 transitions. [2025-03-16 19:57:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:35,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:35,931 INFO L225 Difference]: With dead ends: 3480 [2025-03-16 19:57:35,931 INFO L226 Difference]: Without dead ends: 2972 [2025-03-16 19:57:35,933 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-16 19:57:35,935 INFO L435 NwaCegarLoop]: 4502 mSDtfsCounter, 4732 mSDsluCounter, 13523 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4748 SdHoareTripleChecker+Valid, 18025 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:35,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4748 Valid, 18025 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:57:35,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2025-03-16 19:57:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2883. [2025-03-16 19:57:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2883 states, 2805 states have (on average 1.7989304812834224) internal successors, (5046), 2809 states have internal predecessors, (5046), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-16 19:57:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 5162 transitions. [2025-03-16 19:57:36,016 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 5162 transitions. Word has length 121 [2025-03-16 19:57:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:36,016 INFO L471 AbstractCegarLoop]: Abstraction has 2883 states and 5162 transitions. [2025-03-16 19:57:36,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:36,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 5162 transitions. [2025-03-16 19:57:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:36,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:36,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:57:36,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:57:36,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:36,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2019620394, now seen corresponding path program 1 times [2025-03-16 19:57:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947861931] [2025-03-16 19:57:36,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:36,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:36,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:36,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:36,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:36,184 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-16 19:57:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947861931] [2025-03-16 19:57:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947861931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551819975] [2025-03-16 19:57:36,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:36,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:36,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:36,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:36,187 INFO L87 Difference]: Start difference. First operand 2883 states and 5162 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:36,727 INFO L93 Difference]: Finished difference Result 4243 states and 7346 transitions. [2025-03-16 19:57:36,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:36,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:36,744 INFO L225 Difference]: With dead ends: 4243 [2025-03-16 19:57:36,744 INFO L226 Difference]: Without dead ends: 3495 [2025-03-16 19:57:36,748 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-16 19:57:36,749 INFO L435 NwaCegarLoop]: 4307 mSDtfsCounter, 4751 mSDsluCounter, 13061 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4767 SdHoareTripleChecker+Valid, 17368 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:36,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4767 Valid, 17368 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:36,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2025-03-16 19:57:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3394. [2025-03-16 19:57:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 3266 states have (on average 1.769442743417024) internal successors, (5779), 3274 states have internal predecessors, (5779), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-16 19:57:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 5975 transitions. [2025-03-16 19:57:36,839 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 5975 transitions. Word has length 121 [2025-03-16 19:57:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:36,839 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 5975 transitions. [2025-03-16 19:57:36,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 5975 transitions. [2025-03-16 19:57:36,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:36,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:36,841 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] [2025-03-16 19:57:36,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:57:36,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:36,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:36,842 INFO L85 PathProgramCache]: Analyzing trace with hash -525707945, now seen corresponding path program 1 times [2025-03-16 19:57:36,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:36,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962716454] [2025-03-16 19:57:36,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:36,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:36,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:36,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:36,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:36,952 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-16 19:57:36,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:36,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962716454] [2025-03-16 19:57:36,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962716454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:36,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:36,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947361508] [2025-03-16 19:57:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:36,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:36,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:36,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:36,953 INFO L87 Difference]: Start difference. First operand 3394 states and 5975 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:37,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:37,540 INFO L93 Difference]: Finished difference Result 5888 states and 10013 transitions. [2025-03-16 19:57:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:37,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:37,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:37,557 INFO L225 Difference]: With dead ends: 5888 [2025-03-16 19:57:37,557 INFO L226 Difference]: Without dead ends: 4629 [2025-03-16 19:57:37,561 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-16 19:57:37,561 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 4722 mSDsluCounter, 13502 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4738 SdHoareTripleChecker+Valid, 17997 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:37,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4738 Valid, 17997 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:57:37,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2025-03-16 19:57:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4503. [2025-03-16 19:57:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 4269 states have (on average 1.7331927851955962) internal successors, (7399), 4291 states have internal predecessors, (7399), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-16 19:57:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 7779 transitions. [2025-03-16 19:57:37,683 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 7779 transitions. Word has length 121 [2025-03-16 19:57:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:37,683 INFO L471 AbstractCegarLoop]: Abstraction has 4503 states and 7779 transitions. [2025-03-16 19:57:37,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:37,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 7779 transitions. [2025-03-16 19:57:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:37,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:37,685 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] [2025-03-16 19:57:37,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:57:37,685 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1724443210, now seen corresponding path program 1 times [2025-03-16 19:57:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110670316] [2025-03-16 19:57:37,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:37,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:37,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:37,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:37,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:37,787 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-16 19:57:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:37,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110670316] [2025-03-16 19:57:37,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110670316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:37,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:37,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:37,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5004133] [2025-03-16 19:57:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:37,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:37,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:37,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:37,789 INFO L87 Difference]: Start difference. First operand 4503 states and 7779 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:38,362 INFO L93 Difference]: Finished difference Result 9507 states and 16047 transitions. [2025-03-16 19:57:38,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:38,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:38,390 INFO L225 Difference]: With dead ends: 9507 [2025-03-16 19:57:38,391 INFO L226 Difference]: Without dead ends: 7139 [2025-03-16 19:57:38,400 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-16 19:57:38,401 INFO L435 NwaCegarLoop]: 4492 mSDtfsCounter, 4717 mSDsluCounter, 13493 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4733 SdHoareTripleChecker+Valid, 17985 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:38,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4733 Valid, 17985 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7139 states. [2025-03-16 19:57:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7139 to 6964. [2025-03-16 19:57:38,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6964 states, 6500 states have (on average 1.7026153846153846) internal successors, (11067), 6568 states have internal predecessors, (11067), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-16 19:57:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6964 states to 6964 states and 11911 transitions. [2025-03-16 19:57:38,590 INFO L78 Accepts]: Start accepts. Automaton has 6964 states and 11911 transitions. Word has length 121 [2025-03-16 19:57:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:38,590 INFO L471 AbstractCegarLoop]: Abstraction has 6964 states and 11911 transitions. [2025-03-16 19:57:38,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6964 states and 11911 transitions. [2025-03-16 19:57:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:38,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:38,594 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] [2025-03-16 19:57:38,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:57:38,594 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:38,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1208922761, now seen corresponding path program 1 times [2025-03-16 19:57:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935357930] [2025-03-16 19:57:38,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:38,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:38,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:38,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:38,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:38,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:38,694 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-16 19:57:38,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:38,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935357930] [2025-03-16 19:57:38,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935357930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:38,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:38,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:38,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763459458] [2025-03-16 19:57:38,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:38,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:38,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:38,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:38,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:38,697 INFO L87 Difference]: Start difference. First operand 6964 states and 11911 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:39,386 INFO L93 Difference]: Finished difference Result 17658 states and 30193 transitions. [2025-03-16 19:57:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:39,438 INFO L225 Difference]: With dead ends: 17658 [2025-03-16 19:57:39,438 INFO L226 Difference]: Without dead ends: 12829 [2025-03-16 19:57:39,457 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-16 19:57:39,459 INFO L435 NwaCegarLoop]: 4489 mSDtfsCounter, 4712 mSDsluCounter, 13484 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4728 SdHoareTripleChecker+Valid, 17973 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:39,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4728 Valid, 17973 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2025-03-16 19:57:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 12561. [2025-03-16 19:57:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 11583 states have (on average 1.690667357334024) internal successors, (19583), 11797 states have internal predecessors, (19583), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:57:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 21739 transitions. [2025-03-16 19:57:39,822 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 21739 transitions. Word has length 121 [2025-03-16 19:57:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:39,822 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 21739 transitions. [2025-03-16 19:57:39,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 21739 transitions. [2025-03-16 19:57:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:39,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:39,830 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] [2025-03-16 19:57:39,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:57:39,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:39,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2132842902, now seen corresponding path program 1 times [2025-03-16 19:57:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:39,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326203584] [2025-03-16 19:57:39,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:39,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:39,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:39,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:39,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:39,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:39,909 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-16 19:57:39,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:39,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326203584] [2025-03-16 19:57:39,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326203584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:39,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:39,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:39,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610154988] [2025-03-16 19:57:39,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:39,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:39,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:39,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:39,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:39,911 INFO L87 Difference]: Start difference. First operand 12561 states and 21739 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:40,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:40,406 INFO L93 Difference]: Finished difference Result 25927 states and 45733 transitions. [2025-03-16 19:57:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:40,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:40,455 INFO L225 Difference]: With dead ends: 25927 [2025-03-16 19:57:40,456 INFO L226 Difference]: Without dead ends: 15501 [2025-03-16 19:57:40,487 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-16 19:57:40,488 INFO L435 NwaCegarLoop]: 4261 mSDtfsCounter, 4504 mSDsluCounter, 8408 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 12669 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:40,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 12669 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15501 states. [2025-03-16 19:57:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15501 to 12561. [2025-03-16 19:57:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 11583 states have (on average 1.6878183544850212) internal successors, (19550), 11797 states have internal predecessors, (19550), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:57:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 21706 transitions. [2025-03-16 19:57:41,034 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 21706 transitions. Word has length 121 [2025-03-16 19:57:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:41,035 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 21706 transitions. [2025-03-16 19:57:41,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 21706 transitions. [2025-03-16 19:57:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:41,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:41,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:41,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:57:41,041 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:41,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1361588841, now seen corresponding path program 1 times [2025-03-16 19:57:41,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:41,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260897146] [2025-03-16 19:57:41,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:41,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:41,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:41,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:41,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:41,144 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-16 19:57:41,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260897146] [2025-03-16 19:57:41,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260897146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:41,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:41,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791605733] [2025-03-16 19:57:41,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:41,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:41,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:41,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:41,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:41,147 INFO L87 Difference]: Start difference. First operand 12561 states and 21706 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:41,670 INFO L93 Difference]: Finished difference Result 25682 states and 45177 transitions. [2025-03-16 19:57:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:41,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:41,715 INFO L225 Difference]: With dead ends: 25682 [2025-03-16 19:57:41,715 INFO L226 Difference]: Without dead ends: 15256 [2025-03-16 19:57:41,740 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-16 19:57:41,741 INFO L435 NwaCegarLoop]: 4258 mSDtfsCounter, 4501 mSDsluCounter, 8403 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 12661 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:41,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 12661 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15256 states. [2025-03-16 19:57:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15256 to 12561. [2025-03-16 19:57:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 11583 states have (on average 1.6849693516360182) internal successors, (19517), 11797 states have internal predecessors, (19517), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:57:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 21673 transitions. [2025-03-16 19:57:42,235 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 21673 transitions. Word has length 121 [2025-03-16 19:57:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:42,235 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 21673 transitions. [2025-03-16 19:57:42,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 21673 transitions. [2025-03-16 19:57:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:42,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:42,240 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] [2025-03-16 19:57:42,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:57:42,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:42,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:42,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1889954442, now seen corresponding path program 1 times [2025-03-16 19:57:42,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:42,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910876096] [2025-03-16 19:57:42,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:42,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:42,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:42,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:42,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:42,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:42,329 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-16 19:57:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910876096] [2025-03-16 19:57:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910876096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:42,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:42,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476972944] [2025-03-16 19:57:42,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:42,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:42,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:42,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:42,331 INFO L87 Difference]: Start difference. First operand 12561 states and 21673 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:43,273 INFO L93 Difference]: Finished difference Result 37593 states and 66162 transitions. [2025-03-16 19:57:43,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:43,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:43,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:43,362 INFO L225 Difference]: With dead ends: 37593 [2025-03-16 19:57:43,362 INFO L226 Difference]: Without dead ends: 27167 [2025-03-16 19:57:43,388 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-16 19:57:43,390 INFO L435 NwaCegarLoop]: 4474 mSDtfsCounter, 4918 mSDsluCounter, 13436 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4943 SdHoareTripleChecker+Valid, 17910 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:43,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4943 Valid, 17910 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27167 states. [2025-03-16 19:57:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27167 to 25036. [2025-03-16 19:57:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25036 states, 22900 states have (on average 1.6887772925764193) internal successors, (38673), 23568 states have internal predecessors, (38673), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 19:57:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25036 states to 25036 states and 44925 transitions. [2025-03-16 19:57:44,281 INFO L78 Accepts]: Start accepts. Automaton has 25036 states and 44925 transitions. Word has length 121 [2025-03-16 19:57:44,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:44,282 INFO L471 AbstractCegarLoop]: Abstraction has 25036 states and 44925 transitions. [2025-03-16 19:57:44,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:44,282 INFO L276 IsEmpty]: Start isEmpty. Operand 25036 states and 44925 transitions. [2025-03-16 19:57:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:44,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:44,291 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] [2025-03-16 19:57:44,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:57:44,291 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1214261833, now seen corresponding path program 1 times [2025-03-16 19:57:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483048852] [2025-03-16 19:57:44,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:44,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:44,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:44,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:44,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:44,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483048852] [2025-03-16 19:57:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483048852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:44,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:44,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:44,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310098377] [2025-03-16 19:57:44,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:44,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:44,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:44,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:44,372 INFO L87 Difference]: Start difference. First operand 25036 states and 44925 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:45,744 INFO L93 Difference]: Finished difference Result 54516 states and 101061 transitions. [2025-03-16 19:57:45,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:45,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:45,881 INFO L225 Difference]: With dead ends: 54516 [2025-03-16 19:57:45,882 INFO L226 Difference]: Without dead ends: 31615 [2025-03-16 19:57:45,960 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-16 19:57:45,961 INFO L435 NwaCegarLoop]: 4253 mSDtfsCounter, 4495 mSDsluCounter, 8392 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 12645 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:45,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 12645 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31615 states. [2025-03-16 19:57:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31615 to 25036. [2025-03-16 19:57:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25036 states, 22900 states have (on average 1.685938864628821) internal successors, (38608), 23568 states have internal predecessors, (38608), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 19:57:47,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25036 states to 25036 states and 44860 transitions. [2025-03-16 19:57:47,168 INFO L78 Accepts]: Start accepts. Automaton has 25036 states and 44860 transitions. Word has length 121 [2025-03-16 19:57:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:47,169 INFO L471 AbstractCegarLoop]: Abstraction has 25036 states and 44860 transitions. [2025-03-16 19:57:47,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 25036 states and 44860 transitions. [2025-03-16 19:57:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:47,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:47,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:57:47,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:57:47,178 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2023749290, now seen corresponding path program 1 times [2025-03-16 19:57:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710951501] [2025-03-16 19:57:47,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:47,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:47,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:47,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:47,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:47,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:47,262 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-16 19:57:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:47,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710951501] [2025-03-16 19:57:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710951501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:47,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787328601] [2025-03-16 19:57:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:47,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:47,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:47,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:47,264 INFO L87 Difference]: Start difference. First operand 25036 states and 44860 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:49,194 INFO L93 Difference]: Finished difference Result 79502 states and 149057 transitions. [2025-03-16 19:57:49,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:49,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:49,533 INFO L225 Difference]: With dead ends: 79502 [2025-03-16 19:57:49,533 INFO L226 Difference]: Without dead ends: 56601 [2025-03-16 19:57:49,589 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-16 19:57:49,590 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4886 mSDsluCounter, 12995 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4911 SdHoareTripleChecker+Valid, 17284 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:49,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4911 Valid, 17284 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56601 states. [2025-03-16 19:57:52,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56601 to 53292. [2025-03-16 19:57:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53292 states, 48386 states have (on average 1.6968957963047162) internal successors, (82106), 50448 states have internal predecessors, (82106), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 19:57:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53292 states to 53292 states and 102630 transitions. [2025-03-16 19:57:52,874 INFO L78 Accepts]: Start accepts. Automaton has 53292 states and 102630 transitions. Word has length 121 [2025-03-16 19:57:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:52,874 INFO L471 AbstractCegarLoop]: Abstraction has 53292 states and 102630 transitions. [2025-03-16 19:57:52,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 53292 states and 102630 transitions. [2025-03-16 19:57:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:52,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:52,890 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] [2025-03-16 19:57:52,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:57:52,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:52,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1829463511, now seen corresponding path program 1 times [2025-03-16 19:57:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968359338] [2025-03-16 19:57:52,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:52,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:52,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:52,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:52,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:52,946 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-16 19:57:52,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968359338] [2025-03-16 19:57:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968359338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:52,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93758] [2025-03-16 19:57:52,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:52,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:52,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:52,948 INFO L87 Difference]: Start difference. First operand 53292 states and 102630 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:55,199 INFO L93 Difference]: Finished difference Result 119772 states and 242001 transitions. [2025-03-16 19:57:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:57:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:55,494 INFO L225 Difference]: With dead ends: 119772 [2025-03-16 19:57:55,494 INFO L226 Difference]: Without dead ends: 68615 [2025-03-16 19:57:55,675 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-16 19:57:55,675 INFO L435 NwaCegarLoop]: 4248 mSDtfsCounter, 4491 mSDsluCounter, 8383 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 12631 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:55,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 12631 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68615 states. [2025-03-16 19:57:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68615 to 53292. [2025-03-16 19:57:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53292 states, 48386 states have (on average 1.694229735874013) internal successors, (81977), 50448 states have internal predecessors, (81977), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 19:57:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53292 states to 53292 states and 102501 transitions. [2025-03-16 19:57:59,277 INFO L78 Accepts]: Start accepts. Automaton has 53292 states and 102501 transitions. Word has length 121 [2025-03-16 19:57:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:59,277 INFO L471 AbstractCegarLoop]: Abstraction has 53292 states and 102501 transitions. [2025-03-16 19:57:59,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 53292 states and 102501 transitions. [2025-03-16 19:57:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:57:59,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:59,295 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] [2025-03-16 19:57:59,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:57:59,295 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:59,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1815213366, now seen corresponding path program 1 times [2025-03-16 19:57:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949369525] [2025-03-16 19:57:59,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:59,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:57:59,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:57:59,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:59,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:59,374 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-16 19:57:59,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:59,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949369525] [2025-03-16 19:57:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949369525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:59,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:59,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88699681] [2025-03-16 19:57:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:59,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:59,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:59,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:59,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:59,376 INFO L87 Difference]: Start difference. First operand 53292 states and 102501 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:02,500 INFO L93 Difference]: Finished difference Result 117583 states and 237365 transitions. [2025-03-16 19:58:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:02,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:58:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:02,831 INFO L225 Difference]: With dead ends: 117583 [2025-03-16 19:58:02,831 INFO L226 Difference]: Without dead ends: 66426 [2025-03-16 19:58:02,909 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-16 19:58:02,910 INFO L435 NwaCegarLoop]: 4245 mSDtfsCounter, 4488 mSDsluCounter, 8378 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4504 SdHoareTripleChecker+Valid, 12623 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:02,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4504 Valid, 12623 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:58:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66426 states.