./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.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.07.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5738c99ca39a13f327ff059e5a6f3b47670e1701984219677e7b62ff58bbdc65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:57:06,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:57:06,611 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:06,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:57:06,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:57:06,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:57:06,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:57:06,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:57:06,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:57:06,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:57:06,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:57:06,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:57:06,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:57:06,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:57:06,639 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:57:06,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:57:06,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:57:06,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:57:06,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:57:06,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:57:06,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:57:06,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:57:06,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:57:06,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:57:06,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:57:06,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:57:06,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:57:06,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:57:06,641 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 -> 5738c99ca39a13f327ff059e5a6f3b47670e1701984219677e7b62ff58bbdc65 [2025-03-16 19:57:06,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:57:06,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:57:06,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:57:06,874 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:57:06,874 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:57:06,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c [2025-03-16 19:57:08,030 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c56df1a9/f32a5536a5964fd1a17cb82734b19998/FLAG26e56495e [2025-03-16 19:57:08,644 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:57:08,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.07.cil-2.c [2025-03-16 19:57:08,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c56df1a9/f32a5536a5964fd1a17cb82734b19998/FLAG26e56495e [2025-03-16 19:57:09,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c56df1a9/f32a5536a5964fd1a17cb82734b19998 [2025-03-16 19:57:09,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:57:09,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:57:09,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:57:09,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:57:09,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:57:09,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:57:09" (1/1) ... [2025-03-16 19:57:09,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f100305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:09, skipping insertion in model container [2025-03-16 19:57:09,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:57:09" (1/1) ... [2025-03-16 19:57:09,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:57:10,251 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.07.cil-2.c[378560,378573] [2025-03-16 19:57:10,284 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.07.cil-2.c[383339,383352] [2025-03-16 19:57:10,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:57:10,513 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:57:11,031 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.07.cil-2.c[378560,378573] [2025-03-16 19:57:11,037 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.07.cil-2.c[383339,383352] [2025-03-16 19:57:11,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:57:11,104 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:57:11,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:11 WrapperNode [2025-03-16 19:57:11,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:57:11,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:57:11,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:57:11,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:57:11,120 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:11" (1/1) ... [2025-03-16 19:57:11,195 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:11" (1/1) ... [2025-03-16 19:57:11,500 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12906 [2025-03-16 19:57:11,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:57:11,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:57:11,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:57:11,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:57:11,508 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:11" (1/1) ... [2025-03-16 19:57:11,508 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:11" (1/1) ... [2025-03-16 19:57:11,541 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:11" (1/1) ... [2025-03-16 19:57:11,599 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:11,600 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:11" (1/1) ... [2025-03-16 19:57:11,600 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:11" (1/1) ... [2025-03-16 19:57:11,726 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:11" (1/1) ... [2025-03-16 19:57:11,743 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:11" (1/1) ... [2025-03-16 19:57:11,762 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:11" (1/1) ... [2025-03-16 19:57:11,778 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:11" (1/1) ... [2025-03-16 19:57:11,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:57:11,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:57:11,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:57:11,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:57:11,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:11" (1/1) ... [2025-03-16 19:57:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:57:11,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:57:11,893 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:11,896 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:11,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:57:11,915 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:57:11,915 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:57:11,915 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:57:11,916 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:57:11,916 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:57:11,916 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:57:11,916 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 19:57:11,916 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 19:57:11,916 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:57:11,916 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:57:11,916 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:57:11,916 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:57:11,916 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:57:11,916 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:57:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:57:11,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:57:11,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:57:12,012 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:57:12,013 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:57:17,803 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:57:17,803 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:57:17,804 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:57:17,804 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:57:17,804 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:57:17,804 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:57:17,804 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:57:18,017 INFO L? ?]: Removed 1719 outVars from TransFormulas that were not future-live. [2025-03-16 19:57:18,017 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:57:18,071 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:57:18,071 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:57:18,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:57:18 BoogieIcfgContainer [2025-03-16 19:57:18,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:57:18,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:57:18,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:57:18,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:57:18,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:57:09" (1/3) ... [2025-03-16 19:57:18,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578c8b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:57:18, skipping insertion in model container [2025-03-16 19:57:18,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:57:11" (2/3) ... [2025-03-16 19:57:18,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578c8b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:57:18, skipping insertion in model container [2025-03-16 19:57:18,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:57:18" (3/3) ... [2025-03-16 19:57:18,084 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.07.cil-2.c [2025-03-16 19:57:18,094 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:57:18,097 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.07.cil-2.c that has 8 procedures, 2373 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-03-16 19:57:18,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:57:18,180 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;@6888004, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:57:18,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:57:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 2373 states, 2341 states have (on average 1.8718496369073045) internal successors, (4382), 2345 states have internal predecessors, (4382), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-16 19:57:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:18,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:18,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:18,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:18,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:18,202 INFO L85 PathProgramCache]: Analyzing trace with hash 111501402, now seen corresponding path program 1 times [2025-03-16 19:57:18,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:18,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669208718] [2025-03-16 19:57:18,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:18,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:18,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:18,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:18,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:18,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:18,674 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:18,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:18,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669208718] [2025-03-16 19:57:18,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669208718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:18,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:18,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:18,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733793523] [2025-03-16 19:57:18,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:18,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:18,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:18,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:18,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:18,705 INFO L87 Difference]: Start difference. First operand has 2373 states, 2341 states have (on average 1.8718496369073045) internal successors, (4382), 2345 states have internal predecessors, (4382), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:19,102 INFO L93 Difference]: Finished difference Result 4746 states and 8863 transitions. [2025-03-16 19:57:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:19,121 INFO L225 Difference]: With dead ends: 4746 [2025-03-16 19:57:19,121 INFO L226 Difference]: Without dead ends: 2382 [2025-03-16 19:57:19,131 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:19,133 INFO L435 NwaCegarLoop]: 4260 mSDtfsCounter, 4475 mSDsluCounter, 8411 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4490 SdHoareTripleChecker+Valid, 12671 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:19,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4490 Valid, 12671 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2382 states. [2025-03-16 19:57:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2382 to 2366. [2025-03-16 19:57:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 2335 states have (on average 1.8419700214132761) internal successors, (4301), 2338 states have internal predecessors, (4301), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-16 19:57:19,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 4345 transitions. [2025-03-16 19:57:19,243 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 4345 transitions. Word has length 112 [2025-03-16 19:57:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:19,244 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 4345 transitions. [2025-03-16 19:57:19,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 4345 transitions. [2025-03-16 19:57:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:19,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:19,248 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:19,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:57:19,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:19,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash 787194011, now seen corresponding path program 1 times [2025-03-16 19:57:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:19,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588610644] [2025-03-16 19:57:19,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:19,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:19,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:19,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:19,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:19,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:19,521 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:19,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:19,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588610644] [2025-03-16 19:57:19,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588610644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:19,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:19,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:19,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190489741] [2025-03-16 19:57:19,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:19,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:19,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:19,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:19,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:19,524 INFO L87 Difference]: Start difference. First operand 2366 states and 4345 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:20,143 INFO L93 Difference]: Finished difference Result 2875 states and 5166 transitions. [2025-03-16 19:57:20,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:20,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:20,158 INFO L225 Difference]: With dead ends: 2875 [2025-03-16 19:57:20,158 INFO L226 Difference]: Without dead ends: 2643 [2025-03-16 19:57:20,161 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:20,161 INFO L435 NwaCegarLoop]: 4474 mSDtfsCounter, 4662 mSDsluCounter, 13512 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4677 SdHoareTripleChecker+Valid, 17986 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:20,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4677 Valid, 17986 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:57:20,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2025-03-16 19:57:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2609. [2025-03-16 19:57:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2609 states, 2552 states have (on average 1.8221003134796239) internal successors, (4650), 2557 states have internal predecessors, (4650), 41 states have call successors, (41), 13 states have call predecessors, (41), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-03-16 19:57:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 4737 transitions. [2025-03-16 19:57:20,252 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 4737 transitions. Word has length 112 [2025-03-16 19:57:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:20,252 INFO L471 AbstractCegarLoop]: Abstraction has 2609 states and 4737 transitions. [2025-03-16 19:57:20,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 4737 transitions. [2025-03-16 19:57:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:20,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:20,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:20,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:57:20,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash -22293446, now seen corresponding path program 1 times [2025-03-16 19:57:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812224114] [2025-03-16 19:57:20,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:20,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:20,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:20,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:20,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:20,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:20,461 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:20,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:20,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812224114] [2025-03-16 19:57:20,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812224114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:20,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:20,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:20,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882712960] [2025-03-16 19:57:20,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:20,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:20,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:20,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:20,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:20,466 INFO L87 Difference]: Start difference. First operand 2609 states and 4737 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:20,984 INFO L93 Difference]: Finished difference Result 3600 states and 6337 transitions. [2025-03-16 19:57:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:20,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:20,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:20,996 INFO L225 Difference]: With dead ends: 3600 [2025-03-16 19:57:20,996 INFO L226 Difference]: Without dead ends: 3127 [2025-03-16 19:57:20,999 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:20,999 INFO L435 NwaCegarLoop]: 4437 mSDtfsCounter, 4658 mSDsluCounter, 13434 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 17871 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:21,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 17871 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2025-03-16 19:57:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 3081. [2025-03-16 19:57:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 2976 states have (on average 1.7906586021505377) internal successors, (5329), 2985 states have internal predecessors, (5329), 73 states have call successors, (73), 25 states have call predecessors, (73), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-03-16 19:57:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 5496 transitions. [2025-03-16 19:57:21,080 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 5496 transitions. Word has length 112 [2025-03-16 19:57:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:21,080 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 5496 transitions. [2025-03-16 19:57:21,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 5496 transitions. [2025-03-16 19:57:21,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:21,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:21,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:21,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:57:21,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -464047941, now seen corresponding path program 1 times [2025-03-16 19:57:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488022647] [2025-03-16 19:57:21,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:21,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:21,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:21,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:21,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:21,232 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:21,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:21,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488022647] [2025-03-16 19:57:21,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488022647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:21,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:21,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:21,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645307753] [2025-03-16 19:57:21,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:21,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:21,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:21,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:21,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:21,234 INFO L87 Difference]: Start difference. First operand 3081 states and 5496 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:21,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:21,787 INFO L93 Difference]: Finished difference Result 5113 states and 8814 transitions. [2025-03-16 19:57:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:21,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:21,803 INFO L225 Difference]: With dead ends: 5113 [2025-03-16 19:57:21,803 INFO L226 Difference]: Without dead ends: 4168 [2025-03-16 19:57:21,807 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:21,807 INFO L435 NwaCegarLoop]: 4435 mSDtfsCounter, 4653 mSDsluCounter, 13422 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4668 SdHoareTripleChecker+Valid, 17857 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:21,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4668 Valid, 17857 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4168 states. [2025-03-16 19:57:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4168 to 4099. [2025-03-16 19:57:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4099 states, 3892 states have (on average 1.7510277492291881) internal successors, (6815), 3915 states have internal predecessors, (6815), 137 states have call successors, (137), 49 states have call predecessors, (137), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-03-16 19:57:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 7166 transitions. [2025-03-16 19:57:21,923 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 7166 transitions. Word has length 112 [2025-03-16 19:57:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:21,923 INFO L471 AbstractCegarLoop]: Abstraction has 4099 states and 7166 transitions. [2025-03-16 19:57:21,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 7166 transitions. [2025-03-16 19:57:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:21,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:21,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:21,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:57:21,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:21,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash -478298086, now seen corresponding path program 1 times [2025-03-16 19:57:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:21,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949347181] [2025-03-16 19:57:21,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:21,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:21,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:21,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:21,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:21,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:22,054 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:22,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:22,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949347181] [2025-03-16 19:57:22,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949347181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:22,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:22,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:22,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918127966] [2025-03-16 19:57:22,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:22,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:22,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:22,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:22,056 INFO L87 Difference]: Start difference. First operand 4099 states and 7166 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:22,600 INFO L93 Difference]: Finished difference Result 8416 states and 14364 transitions. [2025-03-16 19:57:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:22,628 INFO L225 Difference]: With dead ends: 8416 [2025-03-16 19:57:22,628 INFO L226 Difference]: Without dead ends: 6453 [2025-03-16 19:57:22,636 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:22,637 INFO L435 NwaCegarLoop]: 4432 mSDtfsCounter, 4648 mSDsluCounter, 13409 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4663 SdHoareTripleChecker+Valid, 17841 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:22,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4663 Valid, 17841 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6453 states. [2025-03-16 19:57:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6453 to 6341. [2025-03-16 19:57:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6341 states, 5912 states have (on average 1.7153247631935047) internal successors, (10141), 5981 states have internal predecessors, (10141), 265 states have call successors, (265), 97 states have call predecessors, (265), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-03-16 19:57:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6341 states to 6341 states and 10956 transitions. [2025-03-16 19:57:22,949 INFO L78 Accepts]: Start accepts. Automaton has 6341 states and 10956 transitions. Word has length 112 [2025-03-16 19:57:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:22,950 INFO L471 AbstractCegarLoop]: Abstraction has 6341 states and 10956 transitions. [2025-03-16 19:57:22,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6341 states and 10956 transitions. [2025-03-16 19:57:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:22,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:22,956 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:22,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:57:22,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:22,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:22,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1448589093, now seen corresponding path program 1 times [2025-03-16 19:57:22,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:22,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320469702] [2025-03-16 19:57:22,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:22,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:22,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:22,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:22,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:23,069 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:23,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:23,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320469702] [2025-03-16 19:57:23,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320469702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:23,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:23,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:23,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150676416] [2025-03-16 19:57:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:23,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:23,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:23,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:23,070 INFO L87 Difference]: Start difference. First operand 6341 states and 10956 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:23,703 INFO L93 Difference]: Finished difference Result 15787 states and 27246 transitions. [2025-03-16 19:57:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:23,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:23,764 INFO L225 Difference]: With dead ends: 15787 [2025-03-16 19:57:23,764 INFO L226 Difference]: Without dead ends: 11582 [2025-03-16 19:57:23,783 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:23,784 INFO L435 NwaCegarLoop]: 4432 mSDtfsCounter, 4643 mSDsluCounter, 13402 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4658 SdHoareTripleChecker+Valid, 17834 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:23,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4658 Valid, 17834 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:23,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11582 states. [2025-03-16 19:57:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11582 to 11391. [2025-03-16 19:57:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11391 states, 10464 states have (on average 1.696769877675841) internal successors, (17755), 10679 states have internal predecessors, (17755), 521 states have call successors, (521), 193 states have call predecessors, (521), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-16 19:57:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11391 states to 11391 states and 19882 transitions. [2025-03-16 19:57:24,180 INFO L78 Accepts]: Start accepts. Automaton has 11391 states and 19882 transitions. Word has length 112 [2025-03-16 19:57:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:24,180 INFO L471 AbstractCegarLoop]: Abstraction has 11391 states and 19882 transitions. [2025-03-16 19:57:24,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:24,181 INFO L276 IsEmpty]: Start isEmpty. Operand 11391 states and 19882 transitions. [2025-03-16 19:57:24,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:24,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:24,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:24,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:57:24,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:24,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -510057478, now seen corresponding path program 1 times [2025-03-16 19:57:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:24,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425333980] [2025-03-16 19:57:24,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:24,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:24,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:24,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:24,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:24,269 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:24,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425333980] [2025-03-16 19:57:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425333980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224988194] [2025-03-16 19:57:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:24,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:24,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:24,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:24,271 INFO L87 Difference]: Start difference. First operand 11391 states and 19882 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:24,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:24,955 INFO L93 Difference]: Finished difference Result 23078 states and 41067 transitions. [2025-03-16 19:57:24,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:24,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:25,012 INFO L225 Difference]: With dead ends: 23078 [2025-03-16 19:57:25,015 INFO L226 Difference]: Without dead ends: 13821 [2025-03-16 19:57:25,052 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:25,053 INFO L435 NwaCegarLoop]: 4241 mSDtfsCounter, 4461 mSDsluCounter, 8374 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 12615 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:25,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4476 Valid, 12615 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2025-03-16 19:57:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 11391. [2025-03-16 19:57:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11391 states, 10464 states have (on average 1.6936162079510704) internal successors, (17722), 10679 states have internal predecessors, (17722), 521 states have call successors, (521), 193 states have call predecessors, (521), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-16 19:57:25,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11391 states to 11391 states and 19849 transitions. [2025-03-16 19:57:25,507 INFO L78 Accepts]: Start accepts. Automaton has 11391 states and 19849 transitions. Word has length 112 [2025-03-16 19:57:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:25,507 INFO L471 AbstractCegarLoop]: Abstraction has 11391 states and 19849 transitions. [2025-03-16 19:57:25,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 11391 states and 19849 transitions. [2025-03-16 19:57:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:25,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:25,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:25,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:57:25,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:25,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash -895424261, now seen corresponding path program 1 times [2025-03-16 19:57:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490229442] [2025-03-16 19:57:25,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:25,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:25,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:25,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:25,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:57:25,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:25,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490229442] [2025-03-16 19:57:25,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490229442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:25,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:25,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:25,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953419373] [2025-03-16 19:57:25,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:25,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:25,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:25,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:25,599 INFO L87 Difference]: Start difference. First operand 11391 states and 19849 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:26,055 INFO L93 Difference]: Finished difference Result 22592 states and 40029 transitions. [2025-03-16 19:57:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:26,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:26,095 INFO L225 Difference]: With dead ends: 22592 [2025-03-16 19:57:26,095 INFO L226 Difference]: Without dead ends: 13335 [2025-03-16 19:57:26,118 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:26,119 INFO L435 NwaCegarLoop]: 4236 mSDtfsCounter, 4455 mSDsluCounter, 8363 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4470 SdHoareTripleChecker+Valid, 12599 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:26,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4470 Valid, 12599 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13335 states. [2025-03-16 19:57:26,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13335 to 11391. [2025-03-16 19:57:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11391 states, 10464 states have (on average 1.6904625382262997) internal successors, (17689), 10679 states have internal predecessors, (17689), 521 states have call successors, (521), 193 states have call predecessors, (521), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-16 19:57:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11391 states to 11391 states and 19816 transitions. [2025-03-16 19:57:26,610 INFO L78 Accepts]: Start accepts. Automaton has 11391 states and 19816 transitions. Word has length 112 [2025-03-16 19:57:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:26,611 INFO L471 AbstractCegarLoop]: Abstraction has 11391 states and 19816 transitions. [2025-03-16 19:57:26,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 11391 states and 19816 transitions. [2025-03-16 19:57:26,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:26,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:26,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:26,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:57:26,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:26,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:26,619 INFO L85 PathProgramCache]: Analyzing trace with hash 958921276, now seen corresponding path program 1 times [2025-03-16 19:57:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146751378] [2025-03-16 19:57:26,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:26,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:26,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:26,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:26,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:26,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:26,805 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:26,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:26,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146751378] [2025-03-16 19:57:26,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146751378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:26,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:26,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:26,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552156726] [2025-03-16 19:57:26,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:26,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:26,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:26,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:26,806 INFO L87 Difference]: Start difference. First operand 11391 states and 19816 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:27,870 INFO L93 Difference]: Finished difference Result 32881 states and 58383 transitions. [2025-03-16 19:57:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:27,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:27,935 INFO L225 Difference]: With dead ends: 32881 [2025-03-16 19:57:27,935 INFO L226 Difference]: Without dead ends: 23626 [2025-03-16 19:57:27,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:57:27,957 INFO L435 NwaCegarLoop]: 4414 mSDtfsCounter, 4766 mSDsluCounter, 13325 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4789 SdHoareTripleChecker+Valid, 17739 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:27,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4789 Valid, 17739 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:57:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23626 states. [2025-03-16 19:57:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23626 to 22207. [2025-03-16 19:57:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22207 states, 20154 states have (on average 1.6825940259998016) internal successors, (33911), 20823 states have internal predecessors, (33911), 1001 states have call successors, (1001), 385 states have call predecessors, (1001), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-16 19:57:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22207 states to 22207 states and 40134 transitions. [2025-03-16 19:57:29,232 INFO L78 Accepts]: Start accepts. Automaton has 22207 states and 40134 transitions. Word has length 112 [2025-03-16 19:57:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:29,232 INFO L471 AbstractCegarLoop]: Abstraction has 22207 states and 40134 transitions. [2025-03-16 19:57:29,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 22207 states and 40134 transitions. [2025-03-16 19:57:29,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:29,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:29,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:29,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:57:29,243 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:29,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2127117531, now seen corresponding path program 1 times [2025-03-16 19:57:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:29,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279064940] [2025-03-16 19:57:29,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:29,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:29,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:29,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:29,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:29,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:29,325 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:29,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:29,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279064940] [2025-03-16 19:57:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279064940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:29,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:29,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:29,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604794361] [2025-03-16 19:57:29,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:29,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:29,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:29,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:29,327 INFO L87 Difference]: Start difference. First operand 22207 states and 40134 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:30,279 INFO L93 Difference]: Finished difference Result 46654 states and 87201 transitions. [2025-03-16 19:57:30,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:30,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:30,368 INFO L225 Difference]: With dead ends: 46654 [2025-03-16 19:57:30,369 INFO L226 Difference]: Without dead ends: 26581 [2025-03-16 19:57:30,407 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:30,408 INFO L435 NwaCegarLoop]: 4231 mSDtfsCounter, 4451 mSDsluCounter, 8354 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4466 SdHoareTripleChecker+Valid, 12585 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:30,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4466 Valid, 12585 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26581 states. [2025-03-16 19:57:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26581 to 22207. [2025-03-16 19:57:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22207 states, 20154 states have (on average 1.6793688597796963) internal successors, (33846), 20823 states have internal predecessors, (33846), 1001 states have call successors, (1001), 385 states have call predecessors, (1001), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-16 19:57:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22207 states to 22207 states and 40069 transitions. [2025-03-16 19:57:31,691 INFO L78 Accepts]: Start accepts. Automaton has 22207 states and 40069 transitions. Word has length 112 [2025-03-16 19:57:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:31,692 INFO L471 AbstractCegarLoop]: Abstraction has 22207 states and 40069 transitions. [2025-03-16 19:57:31,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 22207 states and 40069 transitions. [2025-03-16 19:57:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:31,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:31,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:31,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:57:31,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:31,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 917875292, now seen corresponding path program 1 times [2025-03-16 19:57:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:31,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649471699] [2025-03-16 19:57:31,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:31,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:31,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:31,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:31,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:31,784 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:31,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:31,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649471699] [2025-03-16 19:57:31,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649471699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:31,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:31,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:31,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369983947] [2025-03-16 19:57:31,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:31,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:31,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:31,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:31,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:31,786 INFO L87 Difference]: Start difference. First operand 22207 states and 40069 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:32,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:32,899 INFO L93 Difference]: Finished difference Result 45925 states and 85613 transitions. [2025-03-16 19:57:32,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:32,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:32,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:33,046 INFO L225 Difference]: With dead ends: 45925 [2025-03-16 19:57:33,047 INFO L226 Difference]: Without dead ends: 25852 [2025-03-16 19:57:33,093 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:33,094 INFO L435 NwaCegarLoop]: 4228 mSDtfsCounter, 4448 mSDsluCounter, 8349 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4463 SdHoareTripleChecker+Valid, 12577 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:33,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4463 Valid, 12577 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25852 states. [2025-03-16 19:57:34,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25852 to 22207. [2025-03-16 19:57:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22207 states, 20154 states have (on average 1.6761436935595913) internal successors, (33781), 20823 states have internal predecessors, (33781), 1001 states have call successors, (1001), 385 states have call predecessors, (1001), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-16 19:57:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22207 states to 22207 states and 40004 transitions. [2025-03-16 19:57:34,251 INFO L78 Accepts]: Start accepts. Automaton has 22207 states and 40004 transitions. Word has length 112 [2025-03-16 19:57:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:34,252 INFO L471 AbstractCegarLoop]: Abstraction has 22207 states and 40004 transitions. [2025-03-16 19:57:34,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 22207 states and 40004 transitions. [2025-03-16 19:57:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:34,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:34,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:34,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:57:34,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:34,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2125793467, now seen corresponding path program 1 times [2025-03-16 19:57:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:34,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019141381] [2025-03-16 19:57:34,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:34,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:34,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:34,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:34,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:34,344 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,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:34,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019141381] [2025-03-16 19:57:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019141381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:34,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:34,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:34,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909954098] [2025-03-16 19:57:34,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:34,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:34,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:34,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:34,347 INFO L87 Difference]: Start difference. First operand 22207 states and 40004 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:36,071 INFO L93 Difference]: Finished difference Result 66504 states and 126145 transitions. [2025-03-16 19:57:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:36,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:36,240 INFO L225 Difference]: With dead ends: 66504 [2025-03-16 19:57:36,240 INFO L226 Difference]: Without dead ends: 46433 [2025-03-16 19:57:36,288 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:36,289 INFO L435 NwaCegarLoop]: 4404 mSDtfsCounter, 4664 mSDsluCounter, 13280 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4687 SdHoareTripleChecker+Valid, 17684 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:36,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4687 Valid, 17684 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:57:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46433 states. [2025-03-16 19:57:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46433 to 44953. [2025-03-16 19:57:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44953 states, 40194 states have (on average 1.6659949246156143) internal successors, (66963), 42257 states have internal predecessors, (66963), 1929 states have call successors, (1929), 769 states have call predecessors, (1929), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-16 19:57:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 87458 transitions. [2025-03-16 19:57:38,604 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 87458 transitions. Word has length 112 [2025-03-16 19:57:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:38,604 INFO L471 AbstractCegarLoop]: Abstraction has 44953 states and 87458 transitions. [2025-03-16 19:57:38,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 87458 transitions. [2025-03-16 19:57:38,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:38,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:38,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:38,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:57:38,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:38,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash 640737916, now seen corresponding path program 1 times [2025-03-16 19:57:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:38,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628021723] [2025-03-16 19:57:38,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:38,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:38,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:38,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:38,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:38,687 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,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:38,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628021723] [2025-03-16 19:57:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628021723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:38,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:38,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:57:38,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716328456] [2025-03-16 19:57:38,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:38,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:57:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:38,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:57:38,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:57:38,689 INFO L87 Difference]: Start difference. First operand 44953 states and 87458 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:41,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:41,110 INFO L93 Difference]: Finished difference Result 94333 states and 194393 transitions. [2025-03-16 19:57:41,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:57:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:41,291 INFO L225 Difference]: With dead ends: 94333 [2025-03-16 19:57:41,291 INFO L226 Difference]: Without dead ends: 51514 [2025-03-16 19:57:41,379 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,379 INFO L435 NwaCegarLoop]: 4223 mSDtfsCounter, 4444 mSDsluCounter, 8340 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4459 SdHoareTripleChecker+Valid, 12563 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:41,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4459 Valid, 12563 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:57:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51514 states. [2025-03-16 19:57:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51514 to 44953. [2025-03-16 19:57:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44953 states, 40194 states have (on average 1.6627854903716972) internal successors, (66834), 42257 states have internal predecessors, (66834), 1929 states have call successors, (1929), 769 states have call predecessors, (1929), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-16 19:57:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44953 states to 44953 states and 87329 transitions. [2025-03-16 19:57:44,706 INFO L78 Accepts]: Start accepts. Automaton has 44953 states and 87329 transitions. Word has length 112 [2025-03-16 19:57:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:44,706 INFO L471 AbstractCegarLoop]: Abstraction has 44953 states and 87329 transitions. [2025-03-16 19:57:44,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 44953 states and 87329 transitions. [2025-03-16 19:57:44,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:44,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:44,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:44,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:57:44,719 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:44,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1424116891, now seen corresponding path program 1 times [2025-03-16 19:57:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:44,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712585975] [2025-03-16 19:57:44,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:44,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:44,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:44,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:44,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:44,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:44,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:44,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:44,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712585975] [2025-03-16 19:57:44,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712585975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:44,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:44,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:57:44,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531304395] [2025-03-16 19:57:44,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:44,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:57:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:44,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:57:44,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:57:44,789 INFO L87 Difference]: Start difference. First operand 44953 states and 87329 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:57:49,012 INFO L93 Difference]: Finished difference Result 135682 states and 290683 transitions. [2025-03-16 19:57:49,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:57:49,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:57:49,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:57:49,394 INFO L225 Difference]: With dead ends: 135682 [2025-03-16 19:57:49,394 INFO L226 Difference]: Without dead ends: 92865 [2025-03-16 19:57:49,510 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,510 INFO L435 NwaCegarLoop]: 4396 mSDtfsCounter, 4597 mSDsluCounter, 13245 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 17641 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:57:49,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 17641 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:57:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92865 states. [2025-03-16 19:57:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92865 to 91707. [2025-03-16 19:57:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91707 states, 80142 states have (on average 1.639739462454144) internal successors, (131412), 86451 states have internal predecessors, (131412), 3721 states have call successors, (3721), 1537 states have call predecessors, (3721), 7842 states have return successors, (69766), 3974 states have call predecessors, (69766), 3719 states have call successors, (69766) [2025-03-16 19:57:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91707 states to 91707 states and 204899 transitions. [2025-03-16 19:57:57,143 INFO L78 Accepts]: Start accepts. Automaton has 91707 states and 204899 transitions. Word has length 112 [2025-03-16 19:57:57,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:57:57,144 INFO L471 AbstractCegarLoop]: Abstraction has 91707 states and 204899 transitions. [2025-03-16 19:57:57,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:57:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 91707 states and 204899 transitions. [2025-03-16 19:57:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:57:57,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:57:57,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:57:57,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:57:57,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:57:57,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:57:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash 895197852, now seen corresponding path program 1 times [2025-03-16 19:57:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:57:57,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290257076] [2025-03-16 19:57:57,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:57:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:57:57,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:57:57,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:57:57,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:57:57,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:57:57,224 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:57,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:57:57,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290257076] [2025-03-16 19:57:57,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290257076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:57:57,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:57:57,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:57:57,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176145714] [2025-03-16 19:57:57,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:57:57,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:57:57,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:57:57,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:57:57,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:57:57,226 INFO L87 Difference]: Start difference. First operand 91707 states and 204899 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:58:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:58:05,800 INFO L93 Difference]: Finished difference Result 268539 states and 606212 transitions. [2025-03-16 19:58:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:58:05,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-03-16 19:58:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:58:06,748 INFO L225 Difference]: With dead ends: 268539 [2025-03-16 19:58:06,748 INFO L226 Difference]: Without dead ends: 178968 [2025-03-16 19:58:06,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:58:06,979 INFO L435 NwaCegarLoop]: 4665 mSDtfsCounter, 4614 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4614 SdHoareTripleChecker+Valid, 9249 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:58:06,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4614 Valid, 9249 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:58:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178968 states.