./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58ba472d0eab58f0bee7768d9e5b3bb2a3404d90b32bd7c010fe277536e64fd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:52:00,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:52:00,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:52:00,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:52:00,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:52:00,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:52:00,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:52:00,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:52:00,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:52:00,454 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:52:00,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:52:00,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:52:00,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:52:00,455 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:52:00,455 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:52:00,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:52:00,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:52:00,455 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:52:00,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:52:00,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:52:00,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:52:00,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:52:00,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:52:00,456 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:52:00,456 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:52:00,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:52:00,456 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:52:00,456 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:52:00,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:52:00,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:52:00,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:52:00,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:52:00,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:52:00,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:52:00,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:52:00,457 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:52:00,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:52:00,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:52:00,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:52:00,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:52:00,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:52:00,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:52:00,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:52:00,458 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 -> 58ba472d0eab58f0bee7768d9e5b3bb2a3404d90b32bd7c010fe277536e64fd4 [2025-03-08 06:52:00,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:52:00,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:52:00,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:52:00,694 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:52:00,695 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:52:00,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-1.c [2025-03-08 06:52:01,917 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd24a92c5/6d53133c20d8464dae6bc8ae5a1b0f89/FLAGb072e2c1f [2025-03-08 06:52:02,487 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:52:02,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-1.c [2025-03-08 06:52:02,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd24a92c5/6d53133c20d8464dae6bc8ae5a1b0f89/FLAGb072e2c1f [2025-03-08 06:52:02,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd24a92c5/6d53133c20d8464dae6bc8ae5a1b0f89 [2025-03-08 06:52:02,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:52:02,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:52:02,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:52:02,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:52:02,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:52:02,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:52:02" (1/1) ... [2025-03-08 06:52:02,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d87a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:02, skipping insertion in model container [2025-03-08 06:52:02,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:52:02" (1/1) ... [2025-03-08 06:52:02,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:52:03,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-1.c[381679,381692] [2025-03-08 06:52:03,837 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_label43+token_ring.11.cil-1.c[383339,383352] [2025-03-08 06:52:04,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:52:04,122 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:52:04,617 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_label43+token_ring.11.cil-1.c[381679,381692] [2025-03-08 06:52:04,620 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_label43+token_ring.11.cil-1.c[383339,383352] [2025-03-08 06:52:04,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:52:04,685 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:52:04,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04 WrapperNode [2025-03-08 06:52:04,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:52:04,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:52:04,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:52:04,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:52:04,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:04,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,068 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 13134 [2025-03-08 06:52:05,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:52:05,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:52:05,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:52:05,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:52:05,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:52:05,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,455 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:52:05,586 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:52:05,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:52:05,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:52:05,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (1/1) ... [2025-03-08 06:52:05,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:52:05,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:52:05,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:52:05,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:52:05,631 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:52:05,631 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:52:05,631 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:52:05,631 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:52:05,631 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:52:05,631 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:52:05,631 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:52:05,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:52:05,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:52:05,743 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:52:05,745 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:52:12,024 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:52:12,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:52:12,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:52:12,025 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:52:12,026 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:52:12,026 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:52:12,026 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:52:12,318 INFO L? ?]: Removed 1753 outVars from TransFormulas that were not future-live. [2025-03-08 06:52:12,319 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:52:12,360 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:52:12,360 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:52:12,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:52:12 BoogieIcfgContainer [2025-03-08 06:52:12,360 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:52:12,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:52:12,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:52:12,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:52:12,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:52:02" (1/3) ... [2025-03-08 06:52:12,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33859efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:52:12, skipping insertion in model container [2025-03-08 06:52:12,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:52:04" (2/3) ... [2025-03-08 06:52:12,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33859efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:52:12, skipping insertion in model container [2025-03-08 06:52:12,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:52:12" (3/3) ... [2025-03-08 06:52:12,372 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.11.cil-1.c [2025-03-08 06:52:12,383 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:52:12,385 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.11.cil-1.c that has 8 procedures, 2546 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-08 06:52:12,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:52:12,474 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;@672bad75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:52:12,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:52:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 2546 states, 2510 states have (on average 1.8386454183266931) internal successors, (4615), 2514 states have internal predecessors, (4615), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 06:52:12,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:12,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:12,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:12,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:12,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:12,500 INFO L85 PathProgramCache]: Analyzing trace with hash -232489455, now seen corresponding path program 1 times [2025-03-08 06:52:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:12,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87731018] [2025-03-08 06:52:12,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:12,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:12,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:12,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:12,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:12,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:13,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:13,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87731018] [2025-03-08 06:52:13,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87731018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:13,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:13,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:13,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089903950] [2025-03-08 06:52:13,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:13,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:13,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:13,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:13,048 INFO L87 Difference]: Start difference. First operand has 2546 states, 2510 states have (on average 1.8386454183266931) internal successors, (4615), 2514 states have internal predecessors, (4615), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:13,775 INFO L93 Difference]: Finished difference Result 5457 states and 9945 transitions. [2025-03-08 06:52:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:52:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:13,801 INFO L225 Difference]: With dead ends: 5457 [2025-03-08 06:52:13,802 INFO L226 Difference]: Without dead ends: 2860 [2025-03-08 06:52:13,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:13,819 INFO L435 NwaCegarLoop]: 4467 mSDtfsCounter, 5103 mSDsluCounter, 9180 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5122 SdHoareTripleChecker+Valid, 13647 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:13,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5122 Valid, 13647 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:52:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2025-03-08 06:52:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2831. [2025-03-08 06:52:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2769 states have (on average 1.8031780426146624) internal successors, (4993), 2773 states have internal predecessors, (4993), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-08 06:52:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 5086 transitions. [2025-03-08 06:52:13,988 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 5086 transitions. Word has length 166 [2025-03-08 06:52:13,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:13,989 INFO L471 AbstractCegarLoop]: Abstraction has 2831 states and 5086 transitions. [2025-03-08 06:52:13,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 5086 transitions. [2025-03-08 06:52:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:13,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:13,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:13,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:52:13,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:13,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:13,997 INFO L85 PathProgramCache]: Analyzing trace with hash 60727567, now seen corresponding path program 1 times [2025-03-08 06:52:13,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:13,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317167298] [2025-03-08 06:52:13,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:13,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:14,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:14,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:14,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:14,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317167298] [2025-03-08 06:52:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317167298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:14,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:14,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:14,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142551715] [2025-03-08 06:52:14,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:14,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:14,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:14,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:14,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:14,212 INFO L87 Difference]: Start difference. First operand 2831 states and 5086 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:14,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:14,689 INFO L93 Difference]: Finished difference Result 3594 states and 6323 transitions. [2025-03-08 06:52:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:14,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:14,711 INFO L225 Difference]: With dead ends: 3594 [2025-03-08 06:52:14,711 INFO L226 Difference]: Without dead ends: 2903 [2025-03-08 06:52:14,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:14,716 INFO L435 NwaCegarLoop]: 4386 mSDtfsCounter, 4723 mSDsluCounter, 8623 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4742 SdHoareTripleChecker+Valid, 13009 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:14,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4742 Valid, 13009 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:52:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2025-03-08 06:52:14,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2831. [2025-03-08 06:52:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2769 states have (on average 1.802455760202239) internal successors, (4991), 2773 states have internal predecessors, (4991), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-08 06:52:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 5084 transitions. [2025-03-08 06:52:14,792 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 5084 transitions. Word has length 166 [2025-03-08 06:52:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:14,792 INFO L471 AbstractCegarLoop]: Abstraction has 2831 states and 5084 transitions. [2025-03-08 06:52:14,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 5084 transitions. [2025-03-08 06:52:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:14,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:14,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:14,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:52:14,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:14,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1873478832, now seen corresponding path program 1 times [2025-03-08 06:52:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736145810] [2025-03-08 06:52:14,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:14,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:14,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:14,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:14,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:15,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:15,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736145810] [2025-03-08 06:52:15,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736145810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:15,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:15,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:52:15,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826991823] [2025-03-08 06:52:15,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:15,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:52:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:15,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:52:15,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:15,026 INFO L87 Difference]: Start difference. First operand 2831 states and 5084 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:15,849 INFO L93 Difference]: Finished difference Result 3970 states and 6919 transitions. [2025-03-08 06:52:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:52:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:15,866 INFO L225 Difference]: With dead ends: 3970 [2025-03-08 06:52:15,866 INFO L226 Difference]: Without dead ends: 3279 [2025-03-08 06:52:15,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:52:15,870 INFO L435 NwaCegarLoop]: 4695 mSDtfsCounter, 5035 mSDsluCounter, 14130 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5054 SdHoareTripleChecker+Valid, 18825 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:15,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5054 Valid, 18825 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:52:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-03-08 06:52:15,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3158. [2025-03-08 06:52:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3158 states, 3069 states have (on average 1.77940697295536) internal successors, (5461), 3074 states have internal predecessors, (5461), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-03-08 06:52:15,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 5597 transitions. [2025-03-08 06:52:15,969 INFO L78 Accepts]: Start accepts. Automaton has 3158 states and 5597 transitions. Word has length 166 [2025-03-08 06:52:15,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:15,970 INFO L471 AbstractCegarLoop]: Abstraction has 3158 states and 5597 transitions. [2025-03-08 06:52:15,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 3158 states and 5597 transitions. [2025-03-08 06:52:15,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:15,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:15,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:15,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:52:15,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:15,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:15,973 INFO L85 PathProgramCache]: Analyzing trace with hash 3790063, now seen corresponding path program 1 times [2025-03-08 06:52:15,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:15,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115152560] [2025-03-08 06:52:15,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:15,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:15,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:15,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:15,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:15,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:16,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:16,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115152560] [2025-03-08 06:52:16,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115152560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:16,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:16,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:52:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164395488] [2025-03-08 06:52:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:16,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:52:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:16,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:52:16,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:16,149 INFO L87 Difference]: Start difference. First operand 3158 states and 5597 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:16,941 INFO L93 Difference]: Finished difference Result 5012 states and 8579 transitions. [2025-03-08 06:52:16,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:52:16,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:16,962 INFO L225 Difference]: With dead ends: 5012 [2025-03-08 06:52:16,962 INFO L226 Difference]: Without dead ends: 3994 [2025-03-08 06:52:16,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:52:16,969 INFO L435 NwaCegarLoop]: 4691 mSDtfsCounter, 5030 mSDsluCounter, 14118 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5049 SdHoareTripleChecker+Valid, 18809 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:16,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5049 Valid, 18809 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:52:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2025-03-08 06:52:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3855. [2025-03-08 06:52:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 3710 states have (on average 1.7466307277628033) internal successors, (6480), 3719 states have internal predecessors, (6480), 107 states have call successors, (107), 31 states have call predecessors, (107), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-03-08 06:52:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 6708 transitions. [2025-03-08 06:52:17,070 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 6708 transitions. Word has length 166 [2025-03-08 06:52:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:17,071 INFO L471 AbstractCegarLoop]: Abstraction has 3855 states and 6708 transitions. [2025-03-08 06:52:17,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 6708 transitions. [2025-03-08 06:52:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:17,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:17,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:17,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:52:17,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:17,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash -74200208, now seen corresponding path program 1 times [2025-03-08 06:52:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:17,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370929479] [2025-03-08 06:52:17,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:17,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:17,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:17,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:17,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370929479] [2025-03-08 06:52:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370929479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:52:17,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248675656] [2025-03-08 06:52:17,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:17,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:52:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:17,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:52:17,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:17,223 INFO L87 Difference]: Start difference. First operand 3855 states and 6708 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:17,929 INFO L93 Difference]: Finished difference Result 7263 states and 12236 transitions. [2025-03-08 06:52:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:52:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:17,950 INFO L225 Difference]: With dead ends: 7263 [2025-03-08 06:52:17,950 INFO L226 Difference]: Without dead ends: 5548 [2025-03-08 06:52:17,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:52:17,958 INFO L435 NwaCegarLoop]: 4688 mSDtfsCounter, 5025 mSDsluCounter, 14109 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5044 SdHoareTripleChecker+Valid, 18797 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:17,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5044 Valid, 18797 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:52:17,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5548 states. [2025-03-08 06:52:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5548 to 5372. [2025-03-08 06:52:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 5109 states have (on average 1.7114895282834215) internal successors, (8744), 5132 states have internal predecessors, (8744), 187 states have call successors, (187), 55 states have call predecessors, (187), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-03-08 06:52:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 9180 transitions. [2025-03-08 06:52:18,096 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 9180 transitions. Word has length 166 [2025-03-08 06:52:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:18,097 INFO L471 AbstractCegarLoop]: Abstraction has 5372 states and 9180 transitions. [2025-03-08 06:52:18,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 9180 transitions. [2025-03-08 06:52:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:18,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:18,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:18,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:52:18,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:18,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2016378673, now seen corresponding path program 1 times [2025-03-08 06:52:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536464654] [2025-03-08 06:52:18,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:18,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:18,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:18,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:18,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:18,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536464654] [2025-03-08 06:52:18,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536464654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:18,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:18,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:52:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750414753] [2025-03-08 06:52:18,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:18,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:52:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:18,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:52:18,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:18,243 INFO L87 Difference]: Start difference. First operand 5372 states and 9180 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:18,991 INFO L93 Difference]: Finished difference Result 12238 states and 20538 transitions. [2025-03-08 06:52:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:52:18,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:19,029 INFO L225 Difference]: With dead ends: 12238 [2025-03-08 06:52:19,030 INFO L226 Difference]: Without dead ends: 9006 [2025-03-08 06:52:19,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:52:19,044 INFO L435 NwaCegarLoop]: 4685 mSDtfsCounter, 5020 mSDsluCounter, 14100 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5039 SdHoareTripleChecker+Valid, 18785 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:19,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5039 Valid, 18785 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:52:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9006 states. [2025-03-08 06:52:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9006 to 8757. [2025-03-08 06:52:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8757 states, 8240 states have (on average 1.6888349514563106) internal successors, (13916), 8309 states have internal predecessors, (13916), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:52:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8757 states to 8757 states and 14864 transitions. [2025-03-08 06:52:19,348 INFO L78 Accepts]: Start accepts. Automaton has 8757 states and 14864 transitions. Word has length 166 [2025-03-08 06:52:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:19,348 INFO L471 AbstractCegarLoop]: Abstraction has 8757 states and 14864 transitions. [2025-03-08 06:52:19,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 8757 states and 14864 transitions. [2025-03-08 06:52:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:19,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:19,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:19,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:52:19,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:19,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1384653712, now seen corresponding path program 1 times [2025-03-08 06:52:19,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:19,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795593837] [2025-03-08 06:52:19,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:19,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:19,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:19,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:19,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:19,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:19,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:19,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795593837] [2025-03-08 06:52:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795593837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:19,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:19,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:19,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228026720] [2025-03-08 06:52:19,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:19,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:19,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:19,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:19,468 INFO L87 Difference]: Start difference. First operand 8757 states and 14864 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:19,881 INFO L93 Difference]: Finished difference Result 16868 states and 28768 transitions. [2025-03-08 06:52:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:19,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:19,918 INFO L225 Difference]: With dead ends: 16868 [2025-03-08 06:52:19,918 INFO L226 Difference]: Without dead ends: 10251 [2025-03-08 06:52:19,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:19,937 INFO L435 NwaCegarLoop]: 4373 mSDtfsCounter, 4715 mSDsluCounter, 8598 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 12971 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:19,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 12971 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:52:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10251 states. [2025-03-08 06:52:20,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10251 to 8757. [2025-03-08 06:52:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8757 states, 8240 states have (on average 1.6867718446601943) internal successors, (13899), 8309 states have internal predecessors, (13899), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:52:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8757 states to 8757 states and 14847 transitions. [2025-03-08 06:52:20,308 INFO L78 Accepts]: Start accepts. Automaton has 8757 states and 14847 transitions. Word has length 166 [2025-03-08 06:52:20,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:20,308 INFO L471 AbstractCegarLoop]: Abstraction has 8757 states and 14847 transitions. [2025-03-08 06:52:20,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 8757 states and 14847 transitions. [2025-03-08 06:52:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:20,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:20,312 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:20,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:52:20,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:20,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:20,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1419477649, now seen corresponding path program 1 times [2025-03-08 06:52:20,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:20,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092515804] [2025-03-08 06:52:20,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:20,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:20,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:20,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:20,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:20,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:20,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092515804] [2025-03-08 06:52:20,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092515804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:20,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:20,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:20,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336218045] [2025-03-08 06:52:20,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:20,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:20,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:20,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:20,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:20,403 INFO L87 Difference]: Start difference. First operand 8757 states and 14847 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:20,800 INFO L93 Difference]: Finished difference Result 16785 states and 28568 transitions. [2025-03-08 06:52:20,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:20,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:20,835 INFO L225 Difference]: With dead ends: 16785 [2025-03-08 06:52:20,837 INFO L226 Difference]: Without dead ends: 10168 [2025-03-08 06:52:20,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:20,859 INFO L435 NwaCegarLoop]: 4370 mSDtfsCounter, 4712 mSDsluCounter, 8593 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 12963 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:20,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 12963 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:52:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10168 states. [2025-03-08 06:52:21,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10168 to 8757. [2025-03-08 06:52:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8757 states, 8240 states have (on average 1.6847087378640777) internal successors, (13882), 8309 states have internal predecessors, (13882), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-08 06:52:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8757 states to 8757 states and 14830 transitions. [2025-03-08 06:52:21,098 INFO L78 Accepts]: Start accepts. Automaton has 8757 states and 14830 transitions. Word has length 166 [2025-03-08 06:52:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:21,098 INFO L471 AbstractCegarLoop]: Abstraction has 8757 states and 14830 transitions. [2025-03-08 06:52:21,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8757 states and 14830 transitions. [2025-03-08 06:52:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:21,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:21,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:21,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:52:21,104 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:21,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:21,104 INFO L85 PathProgramCache]: Analyzing trace with hash -519061648, now seen corresponding path program 1 times [2025-03-08 06:52:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:21,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727450834] [2025-03-08 06:52:21,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:21,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:21,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:21,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:21,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:21,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727450834] [2025-03-08 06:52:21,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727450834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:21,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:21,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:52:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121853286] [2025-03-08 06:52:21,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:21,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:52:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:21,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:52:21,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:21,265 INFO L87 Difference]: Start difference. First operand 8757 states and 14830 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:22,335 INFO L93 Difference]: Finished difference Result 23233 states and 39382 transitions. [2025-03-08 06:52:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:52:22,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:22,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:22,404 INFO L225 Difference]: With dead ends: 23233 [2025-03-08 06:52:22,404 INFO L226 Difference]: Without dead ends: 16616 [2025-03-08 06:52:22,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:52:22,434 INFO L435 NwaCegarLoop]: 4668 mSDtfsCounter, 4996 mSDsluCounter, 14053 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5015 SdHoareTripleChecker+Valid, 18721 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:22,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5015 Valid, 18721 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:52:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16616 states. [2025-03-08 06:52:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16616 to 16283. [2025-03-08 06:52:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16283 states, 15204 states have (on average 1.6795580110497237) internal successors, (25536), 15419 states have internal predecessors, (25536), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:52:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16283 states to 16283 states and 27892 transitions. [2025-03-08 06:52:22,936 INFO L78 Accepts]: Start accepts. Automaton has 16283 states and 27892 transitions. Word has length 166 [2025-03-08 06:52:22,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:22,936 INFO L471 AbstractCegarLoop]: Abstraction has 16283 states and 27892 transitions. [2025-03-08 06:52:22,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 16283 states and 27892 transitions. [2025-03-08 06:52:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:22,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:22,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:22,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:52:22,944 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:22,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:22,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1967068495, now seen corresponding path program 1 times [2025-03-08 06:52:22,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:22,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345113621] [2025-03-08 06:52:22,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:22,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:22,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:22,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:22,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:23,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345113621] [2025-03-08 06:52:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345113621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:23,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437750033] [2025-03-08 06:52:23,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:23,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:23,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:23,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:23,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:23,042 INFO L87 Difference]: Start difference. First operand 16283 states and 27892 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:23,719 INFO L93 Difference]: Finished difference Result 34101 states and 59500 transitions. [2025-03-08 06:52:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:23,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:23,789 INFO L225 Difference]: With dead ends: 34101 [2025-03-08 06:52:23,790 INFO L226 Difference]: Without dead ends: 19958 [2025-03-08 06:52:23,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:23,826 INFO L435 NwaCegarLoop]: 4365 mSDtfsCounter, 4708 mSDsluCounter, 8584 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 12949 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:23,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 12949 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:52:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19958 states. [2025-03-08 06:52:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19958 to 16283. [2025-03-08 06:52:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16283 states, 15204 states have (on average 1.6773875295974743) internal successors, (25503), 15419 states have internal predecessors, (25503), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:52:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16283 states to 16283 states and 27859 transitions. [2025-03-08 06:52:24,477 INFO L78 Accepts]: Start accepts. Automaton has 16283 states and 27859 transitions. Word has length 166 [2025-03-08 06:52:24,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:24,479 INFO L471 AbstractCegarLoop]: Abstraction has 16283 states and 27859 transitions. [2025-03-08 06:52:24,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 16283 states and 27859 transitions. [2025-03-08 06:52:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:24,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:24,488 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:24,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:52:24,488 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:24,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:24,489 INFO L85 PathProgramCache]: Analyzing trace with hash -628305072, now seen corresponding path program 1 times [2025-03-08 06:52:24,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:24,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244938679] [2025-03-08 06:52:24,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:24,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:24,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:24,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:24,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244938679] [2025-03-08 06:52:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244938679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828247277] [2025-03-08 06:52:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:24,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:24,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:24,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:24,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:24,625 INFO L87 Difference]: Start difference. First operand 16283 states and 27859 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:25,263 INFO L93 Difference]: Finished difference Result 33856 states and 58944 transitions. [2025-03-08 06:52:25,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:25,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:25,331 INFO L225 Difference]: With dead ends: 33856 [2025-03-08 06:52:25,331 INFO L226 Difference]: Without dead ends: 19713 [2025-03-08 06:52:25,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:25,367 INFO L435 NwaCegarLoop]: 4362 mSDtfsCounter, 4705 mSDsluCounter, 8579 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 12941 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:25,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 12941 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:52:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19713 states. [2025-03-08 06:52:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19713 to 16283. [2025-03-08 06:52:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16283 states, 15204 states have (on average 1.6752170481452249) internal successors, (25470), 15419 states have internal predecessors, (25470), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-08 06:52:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16283 states to 16283 states and 27826 transitions. [2025-03-08 06:52:25,931 INFO L78 Accepts]: Start accepts. Automaton has 16283 states and 27826 transitions. Word has length 166 [2025-03-08 06:52:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:25,933 INFO L471 AbstractCegarLoop]: Abstraction has 16283 states and 27826 transitions. [2025-03-08 06:52:25,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 16283 states and 27826 transitions. [2025-03-08 06:52:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:25,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:25,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:25,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:52:25,941 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:25,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash -446571823, now seen corresponding path program 1 times [2025-03-08 06:52:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:25,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845748023] [2025-03-08 06:52:25,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:25,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:25,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:25,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:25,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:26,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:26,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845748023] [2025-03-08 06:52:26,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845748023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:26,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:26,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:52:26,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253230675] [2025-03-08 06:52:26,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:26,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:52:26,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:26,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:52:26,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:26,051 INFO L87 Difference]: Start difference. First operand 16283 states and 27826 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:27,743 INFO L93 Difference]: Finished difference Result 50449 states and 87465 transitions. [2025-03-08 06:52:27,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:52:27,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:27,902 INFO L225 Difference]: With dead ends: 50449 [2025-03-08 06:52:27,902 INFO L226 Difference]: Without dead ends: 36306 [2025-03-08 06:52:27,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:52:27,962 INFO L435 NwaCegarLoop]: 4653 mSDtfsCounter, 5319 mSDsluCounter, 14005 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5350 SdHoareTripleChecker+Valid, 18658 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:27,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5350 Valid, 18658 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:52:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36306 states. [2025-03-08 06:52:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36306 to 33102. [2025-03-08 06:52:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33102 states, 30769 states have (on average 1.685917644382333) internal successors, (51874), 31438 states have internal predecessors, (51874), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:52:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33102 states to 33102 states and 58518 transitions. [2025-03-08 06:52:29,380 INFO L78 Accepts]: Start accepts. Automaton has 33102 states and 58518 transitions. Word has length 166 [2025-03-08 06:52:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:29,380 INFO L471 AbstractCegarLoop]: Abstraction has 33102 states and 58518 transitions. [2025-03-08 06:52:29,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 33102 states and 58518 transitions. [2025-03-08 06:52:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:29,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:29,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:29,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:52:29,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:29,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash -302162128, now seen corresponding path program 1 times [2025-03-08 06:52:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:29,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909915998] [2025-03-08 06:52:29,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:29,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:29,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:29,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:29,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:29,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:29,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909915998] [2025-03-08 06:52:29,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909915998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:29,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:29,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:29,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651907452] [2025-03-08 06:52:29,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:29,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:29,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:29,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:29,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:29,482 INFO L87 Difference]: Start difference. First operand 33102 states and 58518 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:30,741 INFO L93 Difference]: Finished difference Result 72836 states and 132624 transitions. [2025-03-08 06:52:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:30,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:30,899 INFO L225 Difference]: With dead ends: 72836 [2025-03-08 06:52:30,899 INFO L226 Difference]: Without dead ends: 41874 [2025-03-08 06:52:30,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:30,970 INFO L435 NwaCegarLoop]: 4357 mSDtfsCounter, 4699 mSDsluCounter, 8568 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4718 SdHoareTripleChecker+Valid, 12925 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:30,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4718 Valid, 12925 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:52:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41874 states. [2025-03-08 06:52:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41874 to 33102. [2025-03-08 06:52:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33102 states, 30769 states have (on average 1.683805128538464) internal successors, (51809), 31438 states have internal predecessors, (51809), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:52:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33102 states to 33102 states and 58453 transitions. [2025-03-08 06:52:32,470 INFO L78 Accepts]: Start accepts. Automaton has 33102 states and 58453 transitions. Word has length 166 [2025-03-08 06:52:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:32,470 INFO L471 AbstractCegarLoop]: Abstraction has 33102 states and 58453 transitions. [2025-03-08 06:52:32,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 33102 states and 58453 transitions. [2025-03-08 06:52:32,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:32,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:32,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:32,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:52:32,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:32,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:32,482 INFO L85 PathProgramCache]: Analyzing trace with hash -574598415, now seen corresponding path program 1 times [2025-03-08 06:52:32,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:32,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519880968] [2025-03-08 06:52:32,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:32,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:32,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:32,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:32,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:32,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519880968] [2025-03-08 06:52:32,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519880968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:32,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:32,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73602229] [2025-03-08 06:52:32,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:32,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:32,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:32,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:32,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:32,588 INFO L87 Difference]: Start difference. First operand 33102 states and 58453 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:34,293 INFO L93 Difference]: Finished difference Result 71374 states and 129570 transitions. [2025-03-08 06:52:34,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:34,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:34,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:34,430 INFO L225 Difference]: With dead ends: 71374 [2025-03-08 06:52:34,431 INFO L226 Difference]: Without dead ends: 40412 [2025-03-08 06:52:34,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:34,500 INFO L435 NwaCegarLoop]: 4352 mSDtfsCounter, 4695 mSDsluCounter, 8559 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4714 SdHoareTripleChecker+Valid, 12911 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:34,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4714 Valid, 12911 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:52:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40412 states. [2025-03-08 06:52:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40412 to 33102. [2025-03-08 06:52:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33102 states, 30769 states have (on average 1.6816926126945952) internal successors, (51744), 31438 states have internal predecessors, (51744), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:52:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33102 states to 33102 states and 58388 transitions. [2025-03-08 06:52:35,907 INFO L78 Accepts]: Start accepts. Automaton has 33102 states and 58388 transitions. Word has length 166 [2025-03-08 06:52:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:35,907 INFO L471 AbstractCegarLoop]: Abstraction has 33102 states and 58388 transitions. [2025-03-08 06:52:35,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:35,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33102 states and 58388 transitions. [2025-03-08 06:52:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:35,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:35,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:35,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:52:35,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:35,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:35,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1048624398, now seen corresponding path program 1 times [2025-03-08 06:52:35,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:35,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105390554] [2025-03-08 06:52:35,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:35,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:35,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:35,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:35,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:35,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:35,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:35,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105390554] [2025-03-08 06:52:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105390554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:35,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:35,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:35,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314455201] [2025-03-08 06:52:35,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:35,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:35,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:35,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:35,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:35,979 INFO L87 Difference]: Start difference. First operand 33102 states and 58388 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:37,916 INFO L93 Difference]: Finished difference Result 70643 states and 127978 transitions. [2025-03-08 06:52:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:37,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:38,221 INFO L225 Difference]: With dead ends: 70643 [2025-03-08 06:52:38,221 INFO L226 Difference]: Without dead ends: 39681 [2025-03-08 06:52:38,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:38,268 INFO L435 NwaCegarLoop]: 4349 mSDtfsCounter, 4692 mSDsluCounter, 8554 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4711 SdHoareTripleChecker+Valid, 12903 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:38,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4711 Valid, 12903 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:52:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39681 states. [2025-03-08 06:52:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39681 to 33102. [2025-03-08 06:52:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33102 states, 30769 states have (on average 1.6795800968507264) internal successors, (51679), 31438 states have internal predecessors, (51679), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-08 06:52:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33102 states to 33102 states and 58323 transitions. [2025-03-08 06:52:39,633 INFO L78 Accepts]: Start accepts. Automaton has 33102 states and 58323 transitions. Word has length 166 [2025-03-08 06:52:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:39,633 INFO L471 AbstractCegarLoop]: Abstraction has 33102 states and 58323 transitions. [2025-03-08 06:52:39,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 33102 states and 58323 transitions. [2025-03-08 06:52:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:39,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:39,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:39,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:52:39,644 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:39,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1341010223, now seen corresponding path program 1 times [2025-03-08 06:52:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:39,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932024517] [2025-03-08 06:52:39,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:39,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:39,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:39,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:39,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:39,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:39,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932024517] [2025-03-08 06:52:39,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932024517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:39,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:39,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:52:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182967476] [2025-03-08 06:52:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:39,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:52:39,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:39,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:52:39,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:39,740 INFO L87 Difference]: Start difference. First operand 33102 states and 58323 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:42,829 INFO L93 Difference]: Finished difference Result 104044 states and 189918 transitions. [2025-03-08 06:52:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:52:42,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:43,101 INFO L225 Difference]: With dead ends: 104044 [2025-03-08 06:52:43,101 INFO L226 Difference]: Without dead ends: 73082 [2025-03-08 06:52:43,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:52:43,180 INFO L435 NwaCegarLoop]: 4631 mSDtfsCounter, 5137 mSDsluCounter, 13944 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5168 SdHoareTripleChecker+Valid, 18575 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:43,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5168 Valid, 18575 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:52:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73082 states. [2025-03-08 06:52:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73082 to 69317. [2025-03-08 06:52:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69317 states, 64022 states have (on average 1.6882790290837524) internal successors, (108087), 66085 states have internal predecessors, (108087), 2459 states have call successors, (2459), 775 states have call predecessors, (2459), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-08 06:52:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69317 states to 69317 states and 129387 transitions. [2025-03-08 06:52:46,848 INFO L78 Accepts]: Start accepts. Automaton has 69317 states and 129387 transitions. Word has length 166 [2025-03-08 06:52:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:46,848 INFO L471 AbstractCegarLoop]: Abstraction has 69317 states and 129387 transitions. [2025-03-08 06:52:46,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 69317 states and 129387 transitions. [2025-03-08 06:52:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 06:52:46,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:46,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:46,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:52:46,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:46,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 589220626, now seen corresponding path program 1 times [2025-03-08 06:52:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:46,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331375193] [2025-03-08 06:52:46,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:46,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 06:52:46,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 06:52:46,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:46,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:52:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331375193] [2025-03-08 06:52:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331375193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:46,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:52:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159677396] [2025-03-08 06:52:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:46,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:52:46,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:46,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:52:46,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:52:46,927 INFO L87 Difference]: Start difference. First operand 69317 states and 129387 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:52:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:52:50,157 INFO L93 Difference]: Finished difference Result 151817 states and 295506 transitions. [2025-03-08 06:52:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:52:50,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (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 166 [2025-03-08 06:52:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:50,666 INFO L225 Difference]: With dead ends: 151817 [2025-03-08 06:52:50,666 INFO L226 Difference]: Without dead ends: 84640 [2025-03-08 06:52:50,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:52:50,785 INFO L435 NwaCegarLoop]: 4344 mSDtfsCounter, 4688 mSDsluCounter, 8545 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4707 SdHoareTripleChecker+Valid, 12889 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:50,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4707 Valid, 12889 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:52:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84640 states.