./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.12.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.12.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 ad834a4fb5f4154353fe834bdf1b25d8394c06509e997c3a1b1b485e0c0b77f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:08:17,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:08:17,464 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:08:17,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:08:17,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:08:17,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:08:17,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:08:17,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:08:17,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:08:17,490 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:08:17,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:08:17,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:08:17,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:08:17,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:08:17,492 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:08:17,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:08:17,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:08:17,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:08:17,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:08:17,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:08:17,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:08:17,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:08:17,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:08:17,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:08:17,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:08:17,494 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:08:17,494 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:08:17,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:08:17,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:08:17,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:08:17,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:08:17,495 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:08:17,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:08:17,495 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 -> ad834a4fb5f4154353fe834bdf1b25d8394c06509e997c3a1b1b485e0c0b77f0 [2025-03-16 20:08:17,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:08:17,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:08:17,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:08:17,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:08:17,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:08:17,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.12.cil-1.c [2025-03-16 20:08:18,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bda3955f/2de3e9dce7964a64a7ca42dcd1ac8979/FLAG9e4b7f0bb [2025-03-16 20:08:19,427 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:08:19,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.12.cil-1.c [2025-03-16 20:08:19,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bda3955f/2de3e9dce7964a64a7ca42dcd1ac8979/FLAG9e4b7f0bb [2025-03-16 20:08:19,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bda3955f/2de3e9dce7964a64a7ca42dcd1ac8979 [2025-03-16 20:08:19,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:08:19,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:08:19,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:08:19,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:08:19,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:08:19,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:08:19" (1/1) ... [2025-03-16 20:08:19,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1087f393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:19, skipping insertion in model container [2025-03-16 20:08:19,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:08:19" (1/1) ... [2025-03-16 20:08:20,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:08:21,125 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_label49+token_ring.12.cil-1.c[380593,380606] [2025-03-16 20:08:21,149 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_label49+token_ring.12.cil-1.c[383339,383352] [2025-03-16 20:08:21,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:08:21,356 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:08:21,808 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_label49+token_ring.12.cil-1.c[380593,380606] [2025-03-16 20:08:21,812 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_label49+token_ring.12.cil-1.c[383339,383352] [2025-03-16 20:08:21,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:08:21,896 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:08:21,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21 WrapperNode [2025-03-16 20:08:21,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:08:21,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:08:21,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:08:21,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:08:21,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:21,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,273 INFO L138 Inliner]: procedures = 68, calls = 78, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 13191 [2025-03-16 20:08:22,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:08:22,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:08:22,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:08:22,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:08:22,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:08:22,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,643 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:08:22,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:08:22,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:08:22,731 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:08:22,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (1/1) ... [2025-03-16 20:08:22,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:08:22,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:08:22,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:08:22,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:08:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:08:22,782 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:08:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:08:22,783 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:08:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:08:22,783 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:08:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:08:22,783 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:08:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:08:22,783 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:08:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:08:22,783 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:08:22,783 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:08:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:08:22,784 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:08:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:08:22,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:08:22,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:08:22,899 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:08:22,900 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:08:29,400 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:08:29,401 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:08:29,401 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:08:29,401 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:08:29,402 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:08:29,402 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:08:29,403 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:08:29,749 INFO L? ?]: Removed 1744 outVars from TransFormulas that were not future-live. [2025-03-16 20:08:29,749 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:08:29,809 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:08:29,809 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:08:29,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:08:29 BoogieIcfgContainer [2025-03-16 20:08:29,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:08:29,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:08:29,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:08:29,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:08:29,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:08:19" (1/3) ... [2025-03-16 20:08:29,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65762b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:08:29, skipping insertion in model container [2025-03-16 20:08:29,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:08:21" (2/3) ... [2025-03-16 20:08:29,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65762b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:08:29, skipping insertion in model container [2025-03-16 20:08:29,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:08:29" (3/3) ... [2025-03-16 20:08:29,818 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.12.cil-1.c [2025-03-16 20:08:29,830 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:08:29,833 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.12.cil-1.c that has 8 procedures, 2493 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-16 20:08:29,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:08:29,943 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;@68e45435, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:08:29,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:08:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 2493 states, 2456 states have (on average 1.863599348534202) internal successors, (4577), 2460 states have internal predecessors, (4577), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-16 20:08:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:29,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:29,965 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] [2025-03-16 20:08:29,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:29,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1234650791, now seen corresponding path program 1 times [2025-03-16 20:08:29,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:29,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272802431] [2025-03-16 20:08:29,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:30,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:30,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:30,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:30,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:30,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:30,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:30,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272802431] [2025-03-16 20:08:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272802431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:08:30,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254693853] [2025-03-16 20:08:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:30,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:08:30,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:30,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:08:30,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:30,395 INFO L87 Difference]: Start difference. First operand has 2493 states, 2456 states have (on average 1.863599348534202) internal successors, (4577), 2460 states have internal predecessors, (4577), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:30,599 INFO L93 Difference]: Finished difference Result 4979 states and 9253 transitions. [2025-03-16 20:08:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:08:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2025-03-16 20:08:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:30,630 INFO L225 Difference]: With dead ends: 4979 [2025-03-16 20:08:30,630 INFO L226 Difference]: Without dead ends: 2486 [2025-03-16 20:08:30,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:30,645 INFO L435 NwaCegarLoop]: 4552 mSDtfsCounter, 585 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 8513 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:30,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 8513 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:08:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-16 20:08:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2025-03-16 20:08:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2450 states have (on average 1.833061224489796) internal successors, (4491), 2453 states have internal predecessors, (4491), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 20:08:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4545 transitions. [2025-03-16 20:08:30,790 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4545 transitions. Word has length 162 [2025-03-16 20:08:30,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:30,791 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4545 transitions. [2025-03-16 20:08:30,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4545 transitions. [2025-03-16 20:08:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:30,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:30,798 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] [2025-03-16 20:08:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:08:30,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:30,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1937246630, now seen corresponding path program 1 times [2025-03-16 20:08:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135428959] [2025-03-16 20:08:30,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:30,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:30,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:30,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:30,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:30,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:30,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135428959] [2025-03-16 20:08:30,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135428959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:30,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:30,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:08:30,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921482573] [2025-03-16 20:08:30,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:30,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:08:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:30,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:08:30,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:30,966 INFO L87 Difference]: Start difference. First operand 2486 states and 4545 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:31,035 INFO L93 Difference]: Finished difference Result 2836 states and 5105 transitions. [2025-03-16 20:08:31,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:08:31,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 162 [2025-03-16 20:08:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:31,048 INFO L225 Difference]: With dead ends: 2836 [2025-03-16 20:08:31,048 INFO L226 Difference]: Without dead ends: 2486 [2025-03-16 20:08:31,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:08:31,051 INFO L435 NwaCegarLoop]: 4543 mSDtfsCounter, 572 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 8500 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:31,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 8500 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:08:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-03-16 20:08:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2025-03-16 20:08:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2450 states have (on average 1.8326530612244898) internal successors, (4490), 2453 states have internal predecessors, (4490), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-16 20:08:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4544 transitions. [2025-03-16 20:08:31,121 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4544 transitions. Word has length 162 [2025-03-16 20:08:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:31,121 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4544 transitions. [2025-03-16 20:08:31,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4544 transitions. [2025-03-16 20:08:31,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:31,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:31,125 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] [2025-03-16 20:08:31,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:08:31,126 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:31,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:31,127 INFO L85 PathProgramCache]: Analyzing trace with hash 988756901, now seen corresponding path program 1 times [2025-03-16 20:08:31,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:31,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479505988] [2025-03-16 20:08:31,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:31,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:31,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:31,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:31,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:31,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:31,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:31,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479505988] [2025-03-16 20:08:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479505988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:31,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:31,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:31,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439375051] [2025-03-16 20:08:31,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:31,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:31,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:31,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:31,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:31,376 INFO L87 Difference]: Start difference. First operand 2486 states and 4544 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:31,994 INFO L93 Difference]: Finished difference Result 3229 states and 5753 transitions. [2025-03-16 20:08:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:08:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:32,008 INFO L225 Difference]: With dead ends: 3229 [2025-03-16 20:08:32,009 INFO L226 Difference]: Without dead ends: 2882 [2025-03-16 20:08:32,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:32,012 INFO L435 NwaCegarLoop]: 4422 mSDtfsCounter, 5079 mSDsluCounter, 9103 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5099 SdHoareTripleChecker+Valid, 13525 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:32,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5099 Valid, 13525 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2025-03-16 20:08:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2851. [2025-03-16 20:08:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2787 states have (on average 1.8083961248654468) internal successors, (5040), 2791 states have internal predecessors, (5040), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-16 20:08:32,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5137 transitions. [2025-03-16 20:08:32,090 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5137 transitions. Word has length 162 [2025-03-16 20:08:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:32,091 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5137 transitions. [2025-03-16 20:08:32,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5137 transitions. [2025-03-16 20:08:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:32,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:32,094 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] [2025-03-16 20:08:32,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:08:32,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:32,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:32,095 INFO L85 PathProgramCache]: Analyzing trace with hash -113927291, now seen corresponding path program 1 times [2025-03-16 20:08:32,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:32,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897539990] [2025-03-16 20:08:32,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:32,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:32,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:32,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:32,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:32,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:32,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897539990] [2025-03-16 20:08:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897539990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:32,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:32,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696046691] [2025-03-16 20:08:32,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:32,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:32,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:32,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:32,279 INFO L87 Difference]: Start difference. First operand 2851 states and 5137 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:32,701 INFO L93 Difference]: Finished difference Result 3641 states and 6439 transitions. [2025-03-16 20:08:32,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:32,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:32,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:32,711 INFO L225 Difference]: With dead ends: 3641 [2025-03-16 20:08:32,711 INFO L226 Difference]: Without dead ends: 2929 [2025-03-16 20:08:32,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:32,713 INFO L435 NwaCegarLoop]: 4412 mSDtfsCounter, 4752 mSDsluCounter, 8665 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 13077 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:32,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 13077 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:32,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2929 states. [2025-03-16 20:08:32,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2929 to 2851. [2025-03-16 20:08:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2787 states have (on average 1.8076785073555794) internal successors, (5038), 2791 states have internal predecessors, (5038), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (48), 47 states have call predecessors, (48), 47 states have call successors, (48) [2025-03-16 20:08:32,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5135 transitions. [2025-03-16 20:08:32,774 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5135 transitions. Word has length 162 [2025-03-16 20:08:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:32,774 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5135 transitions. [2025-03-16 20:08:32,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5135 transitions. [2025-03-16 20:08:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:32,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:32,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:32,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:08:32,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:32,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2056105756, now seen corresponding path program 1 times [2025-03-16 20:08:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:32,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987753358] [2025-03-16 20:08:32,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:32,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:32,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:32,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:32,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:32,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987753358] [2025-03-16 20:08:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987753358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889248039] [2025-03-16 20:08:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:32,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:32,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:32,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:32,950 INFO L87 Difference]: Start difference. First operand 2851 states and 5135 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:33,648 INFO L93 Difference]: Finished difference Result 4031 states and 7068 transitions. [2025-03-16 20:08:33,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:33,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:33,664 INFO L225 Difference]: With dead ends: 4031 [2025-03-16 20:08:33,664 INFO L226 Difference]: Without dead ends: 3319 [2025-03-16 20:08:33,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:33,668 INFO L435 NwaCegarLoop]: 4743 mSDtfsCounter, 5080 mSDsluCounter, 14281 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5100 SdHoareTripleChecker+Valid, 19024 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:33,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5100 Valid, 19024 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:33,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2025-03-16 20:08:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3188. [2025-03-16 20:08:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3188 states, 3096 states have (on average 1.7864987080103358) internal successors, (5531), 3101 states have internal predecessors, (5531), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (72), 69 states have call predecessors, (72), 68 states have call successors, (72) [2025-03-16 20:08:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 5673 transitions. [2025-03-16 20:08:33,751 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 5673 transitions. Word has length 162 [2025-03-16 20:08:33,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:33,751 INFO L471 AbstractCegarLoop]: Abstraction has 3188 states and 5673 transitions. [2025-03-16 20:08:33,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 5673 transitions. [2025-03-16 20:08:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:33,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:33,753 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] [2025-03-16 20:08:33,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:08:33,754 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:33,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1344926629, now seen corresponding path program 1 times [2025-03-16 20:08:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:33,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215618301] [2025-03-16 20:08:33,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:33,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:33,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:33,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:33,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:33,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:33,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:33,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215618301] [2025-03-16 20:08:33,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215618301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275918987] [2025-03-16 20:08:33,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:33,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:33,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:33,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:33,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:33,922 INFO L87 Difference]: Start difference. First operand 3188 states and 5673 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:34,603 INFO L93 Difference]: Finished difference Result 5109 states and 8815 transitions. [2025-03-16 20:08:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:34,604 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:34,621 INFO L225 Difference]: With dead ends: 5109 [2025-03-16 20:08:34,622 INFO L226 Difference]: Without dead ends: 4060 [2025-03-16 20:08:34,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:34,627 INFO L435 NwaCegarLoop]: 4739 mSDtfsCounter, 5075 mSDsluCounter, 14269 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5095 SdHoareTripleChecker+Valid, 19008 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:34,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5095 Valid, 19008 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2025-03-16 20:08:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 3909. [2025-03-16 20:08:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3909 states, 3759 states have (on average 1.7568502261239691) internal successors, (6604), 3768 states have internal predecessors, (6604), 112 states have call successors, (112), 31 states have call predecessors, (112), 36 states have return successors, (126), 113 states have call predecessors, (126), 110 states have call successors, (126) [2025-03-16 20:08:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 6842 transitions. [2025-03-16 20:08:34,811 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 6842 transitions. Word has length 162 [2025-03-16 20:08:34,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:34,812 INFO L471 AbstractCegarLoop]: Abstraction has 3909 states and 6842 transitions. [2025-03-16 20:08:34,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:34,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 6842 transitions. [2025-03-16 20:08:34,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:34,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:34,815 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] [2025-03-16 20:08:34,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:08:34,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:34,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1870498620, now seen corresponding path program 1 times [2025-03-16 20:08:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923510848] [2025-03-16 20:08:34,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:34,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:34,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:34,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:34,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:34,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923510848] [2025-03-16 20:08:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923510848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:34,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:34,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575646916] [2025-03-16 20:08:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:34,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:34,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:34,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:34,985 INFO L87 Difference]: Start difference. First operand 3909 states and 6842 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:35,807 INFO L93 Difference]: Finished difference Result 7448 states and 12678 transitions. [2025-03-16 20:08:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:35,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:35,833 INFO L225 Difference]: With dead ends: 7448 [2025-03-16 20:08:35,836 INFO L226 Difference]: Without dead ends: 5678 [2025-03-16 20:08:35,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:35,846 INFO L435 NwaCegarLoop]: 4736 mSDtfsCounter, 5070 mSDsluCounter, 14260 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5090 SdHoareTripleChecker+Valid, 18996 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:35,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5090 Valid, 18996 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2025-03-16 20:08:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 5486. [2025-03-16 20:08:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5486 states, 5214 states have (on average 1.7261219792865363) internal successors, (9000), 5237 states have internal predecessors, (9000), 196 states have call successors, (196), 55 states have call predecessors, (196), 74 states have return successors, (258), 201 states have call predecessors, (258), 194 states have call successors, (258) [2025-03-16 20:08:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 9454 transitions. [2025-03-16 20:08:36,023 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 9454 transitions. Word has length 162 [2025-03-16 20:08:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:36,023 INFO L471 AbstractCegarLoop]: Abstraction has 5486 states and 9454 transitions. [2025-03-16 20:08:36,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 9454 transitions. [2025-03-16 20:08:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:36,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:36,026 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] [2025-03-16 20:08:36,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:08:36,027 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:36,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1835674683, now seen corresponding path program 1 times [2025-03-16 20:08:36,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:36,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854864178] [2025-03-16 20:08:36,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:36,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:36,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:36,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:36,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:36,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:36,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:36,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854864178] [2025-03-16 20:08:36,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854864178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:36,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:36,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:36,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866493135] [2025-03-16 20:08:36,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:36,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:36,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:36,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:36,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:36,157 INFO L87 Difference]: Start difference. First operand 5486 states and 9454 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:36,846 INFO L93 Difference]: Finished difference Result 12647 states and 21488 transitions. [2025-03-16 20:08:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:36,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:36,891 INFO L225 Difference]: With dead ends: 12647 [2025-03-16 20:08:36,892 INFO L226 Difference]: Without dead ends: 9300 [2025-03-16 20:08:36,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:36,905 INFO L435 NwaCegarLoop]: 4457 mSDtfsCounter, 5102 mSDsluCounter, 13592 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5122 SdHoareTripleChecker+Valid, 18049 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:36,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5122 Valid, 18049 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:08:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9300 states. [2025-03-16 20:08:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9300 to 9027. [2025-03-16 20:08:37,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9027 states, 8493 states have (on average 1.7082303073119038) internal successors, (14508), 8562 states have internal predecessors, (14508), 364 states have call successors, (364), 103 states have call predecessors, (364), 168 states have return successors, (618), 377 states have call predecessors, (618), 362 states have call successors, (618) [2025-03-16 20:08:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9027 states to 9027 states and 15490 transitions. [2025-03-16 20:08:37,173 INFO L78 Accepts]: Start accepts. Automaton has 9027 states and 15490 transitions. Word has length 162 [2025-03-16 20:08:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:37,174 INFO L471 AbstractCegarLoop]: Abstraction has 9027 states and 15490 transitions. [2025-03-16 20:08:37,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 9027 states and 15490 transitions. [2025-03-16 20:08:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:37,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:37,181 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] [2025-03-16 20:08:37,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:08:37,181 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:37,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash 520753316, now seen corresponding path program 1 times [2025-03-16 20:08:37,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:37,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832706370] [2025-03-16 20:08:37,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:37,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:37,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:37,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:37,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:37,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832706370] [2025-03-16 20:08:37,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832706370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:37,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:37,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:37,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618836952] [2025-03-16 20:08:37,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:37,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:37,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:37,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:37,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:37,339 INFO L87 Difference]: Start difference. First operand 9027 states and 15490 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:38,235 INFO L93 Difference]: Finished difference Result 24534 states and 42338 transitions. [2025-03-16 20:08:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:38,298 INFO L225 Difference]: With dead ends: 24534 [2025-03-16 20:08:38,299 INFO L226 Difference]: Without dead ends: 17646 [2025-03-16 20:08:38,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:38,326 INFO L435 NwaCegarLoop]: 4730 mSDtfsCounter, 5060 mSDsluCounter, 14242 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5080 SdHoareTripleChecker+Valid, 18972 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:38,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5080 Valid, 18972 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17646 states. [2025-03-16 20:08:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17646 to 17216. [2025-03-16 20:08:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17216 states, 16104 states have (on average 1.711872826626925) internal successors, (27568), 16319 states have internal predecessors, (27568), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-16 20:08:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17216 states to 17216 states and 29990 transitions. [2025-03-16 20:08:38,834 INFO L78 Accepts]: Start accepts. Automaton has 17216 states and 29990 transitions. Word has length 162 [2025-03-16 20:08:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:38,836 INFO L471 AbstractCegarLoop]: Abstraction has 17216 states and 29990 transitions. [2025-03-16 20:08:38,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17216 states and 29990 transitions. [2025-03-16 20:08:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:38,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:38,844 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] [2025-03-16 20:08:38,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:08:38,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:38,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash -927253531, now seen corresponding path program 1 times [2025-03-16 20:08:38,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:38,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670715082] [2025-03-16 20:08:38,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:38,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:38,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:38,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:38,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:38,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:38,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670715082] [2025-03-16 20:08:38,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670715082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:38,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:38,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:38,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574737126] [2025-03-16 20:08:38,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:38,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:38,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:38,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:38,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:38,950 INFO L87 Difference]: Start difference. First operand 17216 states and 29990 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:39,611 INFO L93 Difference]: Finished difference Result 37193 states and 66148 transitions. [2025-03-16 20:08:39,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:39,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:39,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:39,689 INFO L225 Difference]: With dead ends: 37193 [2025-03-16 20:08:39,689 INFO L226 Difference]: Without dead ends: 22116 [2025-03-16 20:08:39,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:39,732 INFO L435 NwaCegarLoop]: 4399 mSDtfsCounter, 4744 mSDsluCounter, 8640 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4764 SdHoareTripleChecker+Valid, 13039 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:39,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4764 Valid, 13039 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22116 states. [2025-03-16 20:08:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22116 to 17216. [2025-03-16 20:08:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17216 states, 16104 states have (on average 1.7098236462990561) internal successors, (27535), 16319 states have internal predecessors, (27535), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-16 20:08:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17216 states to 17216 states and 29957 transitions. [2025-03-16 20:08:40,389 INFO L78 Accepts]: Start accepts. Automaton has 17216 states and 29957 transitions. Word has length 162 [2025-03-16 20:08:40,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:40,389 INFO L471 AbstractCegarLoop]: Abstraction has 17216 states and 29957 transitions. [2025-03-16 20:08:40,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:40,390 INFO L276 IsEmpty]: Start isEmpty. Operand 17216 states and 29957 transitions. [2025-03-16 20:08:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:40,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:40,398 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] [2025-03-16 20:08:40,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:08:40,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:40,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:40,399 INFO L85 PathProgramCache]: Analyzing trace with hash 411509892, now seen corresponding path program 1 times [2025-03-16 20:08:40,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317287954] [2025-03-16 20:08:40,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:40,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:40,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:40,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:40,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:40,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317287954] [2025-03-16 20:08:40,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317287954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:40,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181162396] [2025-03-16 20:08:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:40,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:40,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:40,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:40,529 INFO L87 Difference]: Start difference. First operand 17216 states and 29957 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:41,380 INFO L93 Difference]: Finished difference Result 36948 states and 65592 transitions. [2025-03-16 20:08:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:41,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:41,460 INFO L225 Difference]: With dead ends: 36948 [2025-03-16 20:08:41,460 INFO L226 Difference]: Without dead ends: 21871 [2025-03-16 20:08:41,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:41,500 INFO L435 NwaCegarLoop]: 4396 mSDtfsCounter, 4741 mSDsluCounter, 8635 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 13031 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:41,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 13031 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21871 states. [2025-03-16 20:08:42,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21871 to 17216. [2025-03-16 20:08:42,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17216 states, 16104 states have (on average 1.7077744659711873) internal successors, (27502), 16319 states have internal predecessors, (27502), 700 states have call successors, (700), 199 states have call predecessors, (700), 410 states have return successors, (1722), 729 states have call predecessors, (1722), 698 states have call successors, (1722) [2025-03-16 20:08:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17216 states to 17216 states and 29924 transitions. [2025-03-16 20:08:42,105 INFO L78 Accepts]: Start accepts. Automaton has 17216 states and 29924 transitions. Word has length 162 [2025-03-16 20:08:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:42,105 INFO L471 AbstractCegarLoop]: Abstraction has 17216 states and 29924 transitions. [2025-03-16 20:08:42,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 17216 states and 29924 transitions. [2025-03-16 20:08:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:42,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:42,113 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] [2025-03-16 20:08:42,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:08:42,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash 593243141, now seen corresponding path program 1 times [2025-03-16 20:08:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087457142] [2025-03-16 20:08:42,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:42,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:42,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:42,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:42,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:42,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:42,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:42,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:42,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087457142] [2025-03-16 20:08:42,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087457142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:42,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:42,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896919675] [2025-03-16 20:08:42,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:42,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:42,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:42,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:42,250 INFO L87 Difference]: Start difference. First operand 17216 states and 29924 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:43,611 INFO L93 Difference]: Finished difference Result 52005 states and 92482 transitions. [2025-03-16 20:08:43,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:43,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:43,732 INFO L225 Difference]: With dead ends: 52005 [2025-03-16 20:08:43,732 INFO L226 Difference]: Without dead ends: 36928 [2025-03-16 20:08:43,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:08:43,769 INFO L435 NwaCegarLoop]: 4717 mSDtfsCounter, 5039 mSDsluCounter, 14205 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5059 SdHoareTripleChecker+Valid, 18922 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:43,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5059 Valid, 18922 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:08:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36928 states. [2025-03-16 20:08:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36928 to 36267. [2025-03-16 20:08:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36267 states, 33837 states have (on average 1.7259804356178148) internal successors, (58402), 34506 states have internal predecessors, (58402), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:08:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36267 states to 36267 states and 65240 transitions. [2025-03-16 20:08:44,793 INFO L78 Accepts]: Start accepts. Automaton has 36267 states and 65240 transitions. Word has length 162 [2025-03-16 20:08:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:44,794 INFO L471 AbstractCegarLoop]: Abstraction has 36267 states and 65240 transitions. [2025-03-16 20:08:44,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:44,794 INFO L276 IsEmpty]: Start isEmpty. Operand 36267 states and 65240 transitions. [2025-03-16 20:08:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:44,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:44,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:44,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:08:44,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:44,805 INFO L85 PathProgramCache]: Analyzing trace with hash 737652836, now seen corresponding path program 1 times [2025-03-16 20:08:44,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:44,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852740578] [2025-03-16 20:08:44,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:44,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:44,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:44,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:44,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:44,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852740578] [2025-03-16 20:08:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852740578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:44,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:44,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:44,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110262769] [2025-03-16 20:08:44,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:44,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:44,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:44,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:44,905 INFO L87 Difference]: Start difference. First operand 36267 states and 65240 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:46,727 INFO L93 Difference]: Finished difference Result 82822 states and 153380 transitions. [2025-03-16 20:08:46,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:46,940 INFO L225 Difference]: With dead ends: 82822 [2025-03-16 20:08:46,940 INFO L226 Difference]: Without dead ends: 48694 [2025-03-16 20:08:47,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:47,072 INFO L435 NwaCegarLoop]: 4391 mSDtfsCounter, 4737 mSDsluCounter, 8626 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4757 SdHoareTripleChecker+Valid, 13017 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:47,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4757 Valid, 13017 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48694 states. [2025-03-16 20:08:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48694 to 36267. [2025-03-16 20:08:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36267 states, 33837 states have (on average 1.7240594615361882) internal successors, (58337), 34506 states have internal predecessors, (58337), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:08:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36267 states to 36267 states and 65175 transitions. [2025-03-16 20:08:48,948 INFO L78 Accepts]: Start accepts. Automaton has 36267 states and 65175 transitions. Word has length 162 [2025-03-16 20:08:48,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:48,948 INFO L471 AbstractCegarLoop]: Abstraction has 36267 states and 65175 transitions. [2025-03-16 20:08:48,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36267 states and 65175 transitions. [2025-03-16 20:08:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:48,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:48,959 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] [2025-03-16 20:08:48,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:08:48,960 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:48,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:48,960 INFO L85 PathProgramCache]: Analyzing trace with hash 465216549, now seen corresponding path program 1 times [2025-03-16 20:08:48,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:48,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151833800] [2025-03-16 20:08:48,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:48,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:48,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:48,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:48,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:49,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:49,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151833800] [2025-03-16 20:08:49,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151833800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:49,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258658131] [2025-03-16 20:08:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:49,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:49,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:49,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:49,033 INFO L87 Difference]: Start difference. First operand 36267 states and 65175 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:50,511 INFO L93 Difference]: Finished difference Result 82091 states and 151788 transitions. [2025-03-16 20:08:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:50,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:50,676 INFO L225 Difference]: With dead ends: 82091 [2025-03-16 20:08:50,676 INFO L226 Difference]: Without dead ends: 47963 [2025-03-16 20:08:50,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:50,749 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4734 mSDsluCounter, 8621 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 13009 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:50,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 13009 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:08:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47963 states. [2025-03-16 20:08:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47963 to 36267. [2025-03-16 20:08:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36267 states, 33837 states have (on average 1.7221384874545616) internal successors, (58272), 34506 states have internal predecessors, (58272), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:08:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36267 states to 36267 states and 65110 transitions. [2025-03-16 20:08:52,601 INFO L78 Accepts]: Start accepts. Automaton has 36267 states and 65110 transitions. Word has length 162 [2025-03-16 20:08:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:52,602 INFO L471 AbstractCegarLoop]: Abstraction has 36267 states and 65110 transitions. [2025-03-16 20:08:52,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 36267 states and 65110 transitions. [2025-03-16 20:08:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:52,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:52,613 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] [2025-03-16 20:08:52,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:08:52,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:52,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1344687036, now seen corresponding path program 1 times [2025-03-16 20:08:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:52,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624612809] [2025-03-16 20:08:52,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:52,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:52,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:52,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:52,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:52,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624612809] [2025-03-16 20:08:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624612809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:52,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:08:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140652322] [2025-03-16 20:08:52,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:52,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:08:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:52,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:08:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:08:52,738 INFO L87 Difference]: Start difference. First operand 36267 states and 65110 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:54,431 INFO L93 Difference]: Finished difference Result 81360 states and 150196 transitions. [2025-03-16 20:08:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:08:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:54,595 INFO L225 Difference]: With dead ends: 81360 [2025-03-16 20:08:54,595 INFO L226 Difference]: Without dead ends: 47232 [2025-03-16 20:08:54,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:54,672 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 4731 mSDsluCounter, 8616 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4751 SdHoareTripleChecker+Valid, 13001 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:08:54,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4751 Valid, 13001 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:08:54,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47232 states. [2025-03-16 20:08:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47232 to 36267. [2025-03-16 20:08:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36267 states, 33837 states have (on average 1.720217513372935) internal successors, (58207), 34506 states have internal predecessors, (58207), 1372 states have call successors, (1372), 391 states have call predecessors, (1372), 1056 states have return successors, (5466), 1433 states have call predecessors, (5466), 1370 states have call successors, (5466) [2025-03-16 20:08:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36267 states to 36267 states and 65045 transitions. [2025-03-16 20:08:56,187 INFO L78 Accepts]: Start accepts. Automaton has 36267 states and 65045 transitions. Word has length 162 [2025-03-16 20:08:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:08:56,188 INFO L471 AbstractCegarLoop]: Abstraction has 36267 states and 65045 transitions. [2025-03-16 20:08:56,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 36267 states and 65045 transitions. [2025-03-16 20:08:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:08:56,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:08:56,197 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:08:56,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:08:56,197 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:08:56,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:08:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1818713019, now seen corresponding path program 1 times [2025-03-16 20:08:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:08:56,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722713126] [2025-03-16 20:08:56,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:08:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:08:56,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:08:56,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:08:56,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:08:56,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:08:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:08:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:08:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722713126] [2025-03-16 20:08:56,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722713126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:08:56,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:08:56,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:08:56,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985655281] [2025-03-16 20:08:56,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:08:56,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:08:56,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:08:56,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:08:56,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:08:56,291 INFO L87 Difference]: Start difference. First operand 36267 states and 65045 transitions. Second operand has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:08:59,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:08:59,690 INFO L93 Difference]: Finished difference Result 120162 states and 222716 transitions. [2025-03-16 20:08:59,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:08:59,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 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 162 [2025-03-16 20:08:59,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:08:59,973 INFO L225 Difference]: With dead ends: 120162 [2025-03-16 20:08:59,973 INFO L226 Difference]: Without dead ends: 86034 [2025-03-16 20:09:00,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:09:00,077 INFO L435 NwaCegarLoop]: 4437 mSDtfsCounter, 5163 mSDsluCounter, 13518 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5182 SdHoareTripleChecker+Valid, 17955 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:09:00,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5182 Valid, 17955 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:09:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86034 states. [2025-03-16 20:09:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86034 to 80009. [2025-03-16 20:09:02,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80009 states, 74521 states have (on average 1.742609465788167) internal successors, (129861), 76584 states have internal predecessors, (129861), 2652 states have call successors, (2652), 775 states have call predecessors, (2652), 2834 states have return successors, (19034), 2777 states have call predecessors, (19034), 2650 states have call successors, (19034) [2025-03-16 20:09:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80009 states to 80009 states and 151547 transitions. [2025-03-16 20:09:03,167 INFO L78 Accepts]: Start accepts. Automaton has 80009 states and 151547 transitions. Word has length 162 [2025-03-16 20:09:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:09:03,167 INFO L471 AbstractCegarLoop]: Abstraction has 80009 states and 151547 transitions. [2025-03-16 20:09:03,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.166666666666668) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:09:03,168 INFO L276 IsEmpty]: Start isEmpty. Operand 80009 states and 151547 transitions. [2025-03-16 20:09:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-16 20:09:03,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:09:03,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:09:03,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:09:03,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:09:03,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:09:03,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2111098844, now seen corresponding path program 1 times [2025-03-16 20:09:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:09:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004339459] [2025-03-16 20:09:03,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:09:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:09:03,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-16 20:09:03,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-16 20:09:03,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:09:03,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:09:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:09:03,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:09:03,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004339459] [2025-03-16 20:09:03,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004339459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:09:03,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:09:03,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:09:03,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817623911] [2025-03-16 20:09:03,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:09:03,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:09:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:09:03,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:09:03,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:09:03,262 INFO L87 Difference]: Start difference. First operand 80009 states and 151547 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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)