./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 0becd5109c9f10d4cd495bd258560ff3ae7f6a1dd143c8dd06621d725fa7a35e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:54:36,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:54:36,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:54:36,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:54:36,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:54:36,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:54:36,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:54:36,654 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:54:36,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:54:36,655 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:54:36,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:54:36,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:54:36,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:54:36,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:54:36,657 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:54:36,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:54:36,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:54:36,657 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:54:36,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:54:36,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:54:36,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:54:36,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:54:36,657 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:54:36,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:54:36,658 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:54:36,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:54:36,658 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:54:36,658 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:54:36,658 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:54:36,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:54:36,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:54:36,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:54:36,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:54:36,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:54:36,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:54:36,659 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:54:36,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:54:36,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:54:36,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:54:36,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:54:36,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:54:36,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:54:36,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:54:36,660 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-jdk21/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 -> 0becd5109c9f10d4cd495bd258560ff3ae7f6a1dd143c8dd06621d725fa7a35e [2025-02-05 17:54:36,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:54:36,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:54:36,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:54:36,937 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:54:36,937 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:54:36,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2025-02-05 17:54:38,183 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa403cd8a/525cc2ec9eaf42169ad9fcf289a17995/FLAGbd7496bfe [2025-02-05 17:54:38,500 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:54:38,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2025-02-05 17:54:38,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa403cd8a/525cc2ec9eaf42169ad9fcf289a17995/FLAGbd7496bfe [2025-02-05 17:54:38,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aa403cd8a/525cc2ec9eaf42169ad9fcf289a17995 [2025-02-05 17:54:38,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:54:38,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:54:38,770 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:54:38,770 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:54:38,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:54:38,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:54:38" (1/1) ... [2025-02-05 17:54:38,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d937aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:38, skipping insertion in model container [2025-02-05 17:54:38,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:54:38" (1/1) ... [2025-02-05 17:54:38,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:54:38,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[914,927] [2025-02-05 17:54:38,912 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[7115,7128] [2025-02-05 17:54:38,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:54:38,962 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:54:38,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[914,927] [2025-02-05 17:54:38,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-2.c[7115,7128] [2025-02-05 17:54:39,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:54:39,062 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:54:39,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39 WrapperNode [2025-02-05 17:54:39,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:54:39,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:54:39,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:54:39,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:54:39,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,099 INFO L138 Inliner]: procedures = 65, calls = 75, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 669 [2025-02-05 17:54:39,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:54:39,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:54:39,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:54:39,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:54:39,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,118 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-02-05 17:54:39,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,125 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:54:39,130 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:54:39,130 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:54:39,130 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:54:39,131 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (1/1) ... [2025-02-05 17:54:39,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:54:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:54:39,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:54:39,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:54:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:54:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:54:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:54:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:54:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:54:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:54:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:54:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:54:39,183 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:54:39,183 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:54:39,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:54:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:54:39,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:54:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:54:39,184 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:54:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:54:39,184 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:54:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:54:39,184 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:54:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:54:39,184 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:54:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:54:39,184 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:54:39,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:54:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:54:39,185 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:54:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:54:39,185 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:54:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:54:39,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:54:39,185 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:54:39,185 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:54:39,252 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:54:39,254 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:54:39,760 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-02-05 17:54:39,760 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:54:39,771 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:54:39,771 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:54:39,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:54:39 BoogieIcfgContainer [2025-02-05 17:54:39,772 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:54:39,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:54:39,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:54:39,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:54:39,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:54:38" (1/3) ... [2025-02-05 17:54:39,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c74b43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:54:39, skipping insertion in model container [2025-02-05 17:54:39,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:39" (2/3) ... [2025-02-05 17:54:39,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c74b43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:54:39, skipping insertion in model container [2025-02-05 17:54:39,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:54:39" (3/3) ... [2025-02-05 17:54:39,779 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-2.c [2025-02-05 17:54:39,789 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:54:39,790 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.06.cil-2.c that has 15 procedures, 349 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-02-05 17:54:39,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:54:39,863 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;@efe5d54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:54:39,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:54:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 298 states have (on average 1.5302013422818792) internal successors, (456), 305 states have internal predecessors, (456), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 17:54:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:39,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:39,875 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] [2025-02-05 17:54:39,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:39,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1439008777, now seen corresponding path program 1 times [2025-02-05 17:54:39,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:39,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182825421] [2025-02-05 17:54:39,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:39,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:39,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:39,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:39,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:39,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:40,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:40,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182825421] [2025-02-05 17:54:40,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182825421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:40,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:40,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134286317] [2025-02-05 17:54:40,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:40,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:40,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:40,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:40,080 INFO L87 Difference]: Start difference. First operand has 350 states, 298 states have (on average 1.5302013422818792) internal successors, (456), 305 states have internal predecessors, (456), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:40,136 INFO L93 Difference]: Finished difference Result 679 states and 1013 transitions. [2025-02-05 17:54:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:40,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:54:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:40,146 INFO L225 Difference]: With dead ends: 679 [2025-02-05 17:54:40,146 INFO L226 Difference]: Without dead ends: 339 [2025-02-05 17:54:40,149 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-02-05 17:54:40,151 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 133 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 871 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-02-05 17:54:40,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 871 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-02-05 17:54:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-02-05 17:54:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 290 states have (on average 1.4793103448275862) internal successors, (429), 294 states have internal predecessors, (429), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-02-05 17:54:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 495 transitions. [2025-02-05 17:54:40,210 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 495 transitions. Word has length 65 [2025-02-05 17:54:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:40,211 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 495 transitions. [2025-02-05 17:54:40,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 495 transitions. [2025-02-05 17:54:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:40,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:40,214 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] [2025-02-05 17:54:40,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:54:40,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:40,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:40,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1459346152, now seen corresponding path program 1 times [2025-02-05 17:54:40,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:40,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572034616] [2025-02-05 17:54:40,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:40,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:40,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:40,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:40,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:40,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:40,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572034616] [2025-02-05 17:54:40,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572034616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:40,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:40,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:40,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823502702] [2025-02-05 17:54:40,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:40,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:40,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:40,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:40,562 INFO L87 Difference]: Start difference. First operand 339 states and 495 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:41,091 INFO L93 Difference]: Finished difference Result 534 states and 765 transitions. [2025-02-05 17:54:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:41,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:54:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:41,095 INFO L225 Difference]: With dead ends: 534 [2025-02-05 17:54:41,096 INFO L226 Difference]: Without dead ends: 444 [2025-02-05 17:54:41,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:41,097 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 355 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:41,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1086 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-02-05 17:54:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 437. [2025-02-05 17:54:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 368 states have (on average 1.451086956521739) internal successors, (534), 374 states have internal predecessors, (534), 45 states have call successors, (45), 21 states have call predecessors, (45), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2025-02-05 17:54:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 627 transitions. [2025-02-05 17:54:41,122 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 627 transitions. Word has length 65 [2025-02-05 17:54:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:41,122 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 627 transitions. [2025-02-05 17:54:41,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 627 transitions. [2025-02-05 17:54:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:41,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:41,124 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] [2025-02-05 17:54:41,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:54:41,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:41,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1400281173, now seen corresponding path program 1 times [2025-02-05 17:54:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292427724] [2025-02-05 17:54:41,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:41,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:41,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:41,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:41,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:41,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:41,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292427724] [2025-02-05 17:54:41,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292427724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:41,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:41,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345340032] [2025-02-05 17:54:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:41,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:41,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:41,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:41,319 INFO L87 Difference]: Start difference. First operand 437 states and 627 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:41,892 INFO L93 Difference]: Finished difference Result 760 states and 1060 transitions. [2025-02-05 17:54:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:54:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:41,895 INFO L225 Difference]: With dead ends: 760 [2025-02-05 17:54:41,895 INFO L226 Difference]: Without dead ends: 579 [2025-02-05 17:54:41,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:54:41,897 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 731 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:41,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1326 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-02-05 17:54:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 535. [2025-02-05 17:54:41,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 446 states have (on average 1.4304932735426008) internal successors, (638), 454 states have internal predecessors, (638), 56 states have call successors, (56), 28 states have call predecessors, (56), 31 states have return successors, (67), 56 states have call predecessors, (67), 54 states have call successors, (67) [2025-02-05 17:54:41,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 761 transitions. [2025-02-05 17:54:41,932 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 761 transitions. Word has length 65 [2025-02-05 17:54:41,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:41,932 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 761 transitions. [2025-02-05 17:54:41,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:41,933 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 761 transitions. [2025-02-05 17:54:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:41,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:41,935 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] [2025-02-05 17:54:41,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:54:41,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:41,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:41,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1761495530, now seen corresponding path program 1 times [2025-02-05 17:54:41,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:41,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960084674] [2025-02-05 17:54:41,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:41,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:41,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:41,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:41,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:41,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:42,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960084674] [2025-02-05 17:54:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960084674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:42,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:42,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159080219] [2025-02-05 17:54:42,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:42,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:42,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:42,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:42,006 INFO L87 Difference]: Start difference. First operand 535 states and 761 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:42,055 INFO L93 Difference]: Finished difference Result 813 states and 1137 transitions. [2025-02-05 17:54:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-02-05 17:54:42,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:42,059 INFO L225 Difference]: With dead ends: 813 [2025-02-05 17:54:42,059 INFO L226 Difference]: Without dead ends: 540 [2025-02-05 17:54:42,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:42,060 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 0 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:42,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2455 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-05 17:54:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-02-05 17:54:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 450 states have (on average 1.4222222222222223) internal successors, (640), 458 states have internal predecessors, (640), 56 states have call successors, (56), 28 states have call predecessors, (56), 32 states have return successors, (68), 57 states have call predecessors, (68), 54 states have call successors, (68) [2025-02-05 17:54:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 764 transitions. [2025-02-05 17:54:42,095 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 764 transitions. Word has length 65 [2025-02-05 17:54:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:42,095 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 764 transitions. [2025-02-05 17:54:42,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 764 transitions. [2025-02-05 17:54:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:42,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:42,097 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] [2025-02-05 17:54:42,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:54:42,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:42,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash -128691531, now seen corresponding path program 1 times [2025-02-05 17:54:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:42,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854270345] [2025-02-05 17:54:42,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:42,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:42,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:42,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:42,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:42,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854270345] [2025-02-05 17:54:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854270345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:42,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:42,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:54:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410972800] [2025-02-05 17:54:42,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:42,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:54:42,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:42,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:54:42,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:54:42,185 INFO L87 Difference]: Start difference. First operand 540 states and 764 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:54:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:43,226 INFO L93 Difference]: Finished difference Result 1808 states and 2468 transitions. [2025-02-05 17:54:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:54:43,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-02-05 17:54:43,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:43,233 INFO L225 Difference]: With dead ends: 1808 [2025-02-05 17:54:43,233 INFO L226 Difference]: Without dead ends: 1512 [2025-02-05 17:54:43,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-02-05 17:54:43,235 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2252 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:43,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 1494 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:54:43,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2025-02-05 17:54:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1458. [2025-02-05 17:54:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1182 states have (on average 1.3401015228426396) internal successors, (1584), 1205 states have internal predecessors, (1584), 144 states have call successors, (144), 111 states have call predecessors, (144), 130 states have return successors, (182), 144 states have call predecessors, (182), 142 states have call successors, (182) [2025-02-05 17:54:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1910 transitions. [2025-02-05 17:54:43,367 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1910 transitions. Word has length 65 [2025-02-05 17:54:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:43,368 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 1910 transitions. [2025-02-05 17:54:43,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:54:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1910 transitions. [2025-02-05 17:54:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:43,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:43,370 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] [2025-02-05 17:54:43,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:54:43,370 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:43,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1187641123, now seen corresponding path program 1 times [2025-02-05 17:54:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:43,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049783114] [2025-02-05 17:54:43,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:43,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:43,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:43,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:43,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:43,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:43,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049783114] [2025-02-05 17:54:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049783114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:43,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589657870] [2025-02-05 17:54:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:43,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:43,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:43,468 INFO L87 Difference]: Start difference. First operand 1458 states and 1910 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:43,554 INFO L93 Difference]: Finished difference Result 2696 states and 3494 transitions. [2025-02-05 17:54:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:43,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-02-05 17:54:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:43,562 INFO L225 Difference]: With dead ends: 2696 [2025-02-05 17:54:43,562 INFO L226 Difference]: Without dead ends: 1488 [2025-02-05 17:54:43,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:43,569 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 0 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:43,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2455 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2025-02-05 17:54:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2025-02-05 17:54:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1206 states have (on average 1.3266998341625207) internal successors, (1600), 1229 states have internal predecessors, (1600), 144 states have call successors, (144), 111 states have call predecessors, (144), 136 states have return successors, (188), 150 states have call predecessors, (188), 142 states have call successors, (188) [2025-02-05 17:54:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1932 transitions. [2025-02-05 17:54:43,662 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1932 transitions. Word has length 66 [2025-02-05 17:54:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:43,662 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1932 transitions. [2025-02-05 17:54:43,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1932 transitions. [2025-02-05 17:54:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:43,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:43,664 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] [2025-02-05 17:54:43,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:54:43,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:43,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1176324996, now seen corresponding path program 1 times [2025-02-05 17:54:43,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:43,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204361371] [2025-02-05 17:54:43,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:43,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:43,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:43,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:43,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:43,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204361371] [2025-02-05 17:54:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204361371] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:43,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:43,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329410432] [2025-02-05 17:54:43,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:43,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:43,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:43,854 INFO L87 Difference]: Start difference. First operand 1488 states and 1932 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:44,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:44,461 INFO L93 Difference]: Finished difference Result 2720 states and 3435 transitions. [2025-02-05 17:54:44,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:54:44,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 17:54:44,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:44,470 INFO L225 Difference]: With dead ends: 2720 [2025-02-05 17:54:44,470 INFO L226 Difference]: Without dead ends: 1710 [2025-02-05 17:54:44,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:54:44,473 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 716 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:44,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 1113 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2025-02-05 17:54:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1429. [2025-02-05 17:54:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1163 states have (on average 1.3233018056749786) internal successors, (1539), 1181 states have internal predecessors, (1539), 138 states have call successors, (138), 106 states have call predecessors, (138), 126 states have return successors, (173), 143 states have call predecessors, (173), 136 states have call successors, (173) [2025-02-05 17:54:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1850 transitions. [2025-02-05 17:54:44,545 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 1850 transitions. Word has length 66 [2025-02-05 17:54:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:44,545 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 1850 transitions. [2025-02-05 17:54:44,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 1850 transitions. [2025-02-05 17:54:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:44,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:44,546 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] [2025-02-05 17:54:44,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:54:44,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1041432957, now seen corresponding path program 1 times [2025-02-05 17:54:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:44,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842640263] [2025-02-05 17:54:44,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:44,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:44,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:44,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:44,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842640263] [2025-02-05 17:54:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842640263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:54:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228118878] [2025-02-05 17:54:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:44,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:54:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:44,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:54:44,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:54:44,618 INFO L87 Difference]: Start difference. First operand 1429 states and 1850 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:45,029 INFO L93 Difference]: Finished difference Result 3675 states and 4684 transitions. [2025-02-05 17:54:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:54:45,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 17:54:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:45,042 INFO L225 Difference]: With dead ends: 3675 [2025-02-05 17:54:45,042 INFO L226 Difference]: Without dead ends: 2497 [2025-02-05 17:54:45,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:45,046 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 675 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:45,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 571 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:54:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2025-02-05 17:54:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2493. [2025-02-05 17:54:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 1987 states have (on average 1.2752893809763461) internal successors, (2534), 2021 states have internal predecessors, (2534), 254 states have call successors, (254), 205 states have call predecessors, (254), 250 states have return successors, (361), 268 states have call predecessors, (361), 252 states have call successors, (361) [2025-02-05 17:54:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 3149 transitions. [2025-02-05 17:54:45,196 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 3149 transitions. Word has length 66 [2025-02-05 17:54:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:45,197 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 3149 transitions. [2025-02-05 17:54:45,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 3149 transitions. [2025-02-05 17:54:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:54:45,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:45,198 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:45,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:54:45,198 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2028327501, now seen corresponding path program 1 times [2025-02-05 17:54:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:45,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463689756] [2025-02-05 17:54:45,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:45,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:54:45,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:54:45,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:45,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:45,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463689756] [2025-02-05 17:54:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463689756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108842996] [2025-02-05 17:54:45,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:45,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:45,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:45,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:45,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:45,233 INFO L87 Difference]: Start difference. First operand 2493 states and 3149 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:45,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:45,363 INFO L93 Difference]: Finished difference Result 5592 states and 7013 transitions. [2025-02-05 17:54:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:45,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-02-05 17:54:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:45,379 INFO L225 Difference]: With dead ends: 5592 [2025-02-05 17:54:45,379 INFO L226 Difference]: Without dead ends: 3314 [2025-02-05 17:54:45,385 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-02-05 17:54:45,385 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 101 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:45,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 974 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:45,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states. [2025-02-05 17:54:45,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 3252. [2025-02-05 17:54:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3252 states, 2575 states have (on average 1.2633009708737863) internal successors, (3253), 2614 states have internal predecessors, (3253), 338 states have call successors, (338), 278 states have call predecessors, (338), 337 states have return successors, (465), 361 states have call predecessors, (465), 336 states have call successors, (465) [2025-02-05 17:54:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 4056 transitions. [2025-02-05 17:54:45,576 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 4056 transitions. Word has length 67 [2025-02-05 17:54:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:45,577 INFO L471 AbstractCegarLoop]: Abstraction has 3252 states and 4056 transitions. [2025-02-05 17:54:45,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 4056 transitions. [2025-02-05 17:54:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 17:54:45,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:45,579 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] [2025-02-05 17:54:45,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:54:45,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:45,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:45,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1780580009, now seen corresponding path program 1 times [2025-02-05 17:54:45,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:45,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502829343] [2025-02-05 17:54:45,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:45,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 17:54:45,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 17:54:45,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:45,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:45,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:45,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502829343] [2025-02-05 17:54:45,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502829343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:45,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:45,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:45,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428199713] [2025-02-05 17:54:45,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:45,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:45,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:45,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:45,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:45,625 INFO L87 Difference]: Start difference. First operand 3252 states and 4056 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:45,668 INFO L93 Difference]: Finished difference Result 3602 states and 4475 transitions. [2025-02-05 17:54:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:45,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-02-05 17:54:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:45,673 INFO L225 Difference]: With dead ends: 3602 [2025-02-05 17:54:45,674 INFO L226 Difference]: Without dead ends: 596 [2025-02-05 17:54:45,678 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-02-05 17:54:45,679 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 455 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:45,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 473 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-02-05 17:54:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 552. [2025-02-05 17:54:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 450 states have (on average 1.3222222222222222) internal successors, (595), 456 states have internal predecessors, (595), 60 states have call successors, (60), 37 states have call predecessors, (60), 40 states have return successors, (62), 60 states have call predecessors, (62), 58 states have call successors, (62) [2025-02-05 17:54:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 717 transitions. [2025-02-05 17:54:45,741 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 717 transitions. Word has length 73 [2025-02-05 17:54:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:45,742 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 717 transitions. [2025-02-05 17:54:45,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 717 transitions. [2025-02-05 17:54:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:54:45,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:45,743 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:45,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:54:45,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:45,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:45,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1660961211, now seen corresponding path program 1 times [2025-02-05 17:54:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078518397] [2025-02-05 17:54:45,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:45,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:45,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:54:45,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:54:45,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:45,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 17:54:45,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:45,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078518397] [2025-02-05 17:54:45,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078518397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:45,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:45,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:45,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921216562] [2025-02-05 17:54:45,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:45,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:45,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:45,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:45,836 INFO L87 Difference]: Start difference. First operand 552 states and 717 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:54:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:46,500 INFO L93 Difference]: Finished difference Result 1153 states and 1394 transitions. [2025-02-05 17:54:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 17:54:46,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2025-02-05 17:54:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:46,506 INFO L225 Difference]: With dead ends: 1153 [2025-02-05 17:54:46,506 INFO L226 Difference]: Without dead ends: 789 [2025-02-05 17:54:46,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:54:46,509 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 516 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:46,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1328 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-02-05 17:54:46,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 749. [2025-02-05 17:54:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 598 states have (on average 1.2675585284280937) internal successors, (758), 605 states have internal predecessors, (758), 84 states have call successors, (84), 58 states have call predecessors, (84), 65 states have return successors, (93), 87 states have call predecessors, (93), 82 states have call successors, (93) [2025-02-05 17:54:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 935 transitions. [2025-02-05 17:54:46,568 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 935 transitions. Word has length 84 [2025-02-05 17:54:46,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:46,568 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 935 transitions. [2025-02-05 17:54:46,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:54:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 935 transitions. [2025-02-05 17:54:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:46,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:46,570 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:46,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:54:46,571 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:46,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1203889460, now seen corresponding path program 1 times [2025-02-05 17:54:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:46,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637664182] [2025-02-05 17:54:46,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:46,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:46,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:46,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:46,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:46,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:46,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637664182] [2025-02-05 17:54:46,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637664182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:46,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:46,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:46,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279336878] [2025-02-05 17:54:46,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:46,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:46,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:46,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:46,658 INFO L87 Difference]: Start difference. First operand 749 states and 935 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:47,080 INFO L93 Difference]: Finished difference Result 1227 states and 1665 transitions. [2025-02-05 17:54:47,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:47,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:47,085 INFO L225 Difference]: With dead ends: 1227 [2025-02-05 17:54:47,085 INFO L226 Difference]: Without dead ends: 1000 [2025-02-05 17:54:47,086 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-02-05 17:54:47,087 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 792 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:47,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1137 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:47,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2025-02-05 17:54:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 983. [2025-02-05 17:54:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 810 states have (on average 1.3358024691358024) internal successors, (1082), 818 states have internal predecessors, (1082), 99 states have call successors, (99), 64 states have call predecessors, (99), 72 states have return successors, (109), 102 states have call predecessors, (109), 97 states have call successors, (109) [2025-02-05 17:54:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1290 transitions. [2025-02-05 17:54:47,131 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1290 transitions. Word has length 112 [2025-02-05 17:54:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:47,131 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1290 transitions. [2025-02-05 17:54:47,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1290 transitions. [2025-02-05 17:54:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:47,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:47,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:47,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:54:47,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:47,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash -304094858, now seen corresponding path program 1 times [2025-02-05 17:54:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:47,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940649193] [2025-02-05 17:54:47,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:47,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:47,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:47,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:47,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:47,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940649193] [2025-02-05 17:54:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940649193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:47,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:47,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:47,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762413324] [2025-02-05 17:54:47,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:47,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:47,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:47,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:47,254 INFO L87 Difference]: Start difference. First operand 983 states and 1290 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:47,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:47,794 INFO L93 Difference]: Finished difference Result 1736 states and 2448 transitions. [2025-02-05 17:54:47,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:47,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:47,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:47,800 INFO L225 Difference]: With dead ends: 1736 [2025-02-05 17:54:47,801 INFO L226 Difference]: Without dead ends: 1275 [2025-02-05 17:54:47,803 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-02-05 17:54:47,804 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 790 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:47,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 2100 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2025-02-05 17:54:47,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1202. [2025-02-05 17:54:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1007 states have (on average 1.3664349553128103) internal successors, (1376), 1016 states have internal predecessors, (1376), 114 states have call successors, (114), 70 states have call predecessors, (114), 79 states have return successors, (127), 118 states have call predecessors, (127), 112 states have call successors, (127) [2025-02-05 17:54:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1617 transitions. [2025-02-05 17:54:47,862 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1617 transitions. Word has length 112 [2025-02-05 17:54:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:47,864 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1617 transitions. [2025-02-05 17:54:47,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1617 transitions. [2025-02-05 17:54:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:47,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:47,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:47,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:54:47,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:47,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1113582315, now seen corresponding path program 1 times [2025-02-05 17:54:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50065987] [2025-02-05 17:54:47,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:47,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:47,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:47,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:47,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:47,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:47,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50065987] [2025-02-05 17:54:47,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50065987] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:47,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:47,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:47,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096855016] [2025-02-05 17:54:47,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:47,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:47,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:47,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:47,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:47,971 INFO L87 Difference]: Start difference. First operand 1202 states and 1617 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:48,546 INFO L93 Difference]: Finished difference Result 2427 states and 3496 transitions. [2025-02-05 17:54:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:48,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:48,553 INFO L225 Difference]: With dead ends: 2427 [2025-02-05 17:54:48,554 INFO L226 Difference]: Without dead ends: 1747 [2025-02-05 17:54:48,556 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-02-05 17:54:48,556 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 785 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:48,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2084 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:48,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2025-02-05 17:54:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1665. [2025-02-05 17:54:48,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1424 states have (on average 1.4094101123595506) internal successors, (2007), 1437 states have internal predecessors, (2007), 144 states have call successors, (144), 82 states have call predecessors, (144), 95 states have return successors, (169), 150 states have call predecessors, (169), 142 states have call successors, (169) [2025-02-05 17:54:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2320 transitions. [2025-02-05 17:54:48,628 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2320 transitions. Word has length 112 [2025-02-05 17:54:48,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:48,628 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2320 transitions. [2025-02-05 17:54:48,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2320 transitions. [2025-02-05 17:54:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:48,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:48,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:48,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:54:48,631 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:48,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:48,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1555336810, now seen corresponding path program 1 times [2025-02-05 17:54:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:48,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085688531] [2025-02-05 17:54:48,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:48,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:48,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:48,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:48,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:48,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:48,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085688531] [2025-02-05 17:54:48,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085688531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:48,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:48,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:48,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919756124] [2025-02-05 17:54:48,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:48,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:48,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:48,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:48,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:48,719 INFO L87 Difference]: Start difference. First operand 1665 states and 2320 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:49,282 INFO L93 Difference]: Finished difference Result 3904 states and 5785 transitions. [2025-02-05 17:54:49,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:49,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:49,292 INFO L225 Difference]: With dead ends: 3904 [2025-02-05 17:54:49,293 INFO L226 Difference]: Without dead ends: 2761 [2025-02-05 17:54:49,297 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-02-05 17:54:49,297 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 780 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:49,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 2072 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2025-02-05 17:54:49,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2660. [2025-02-05 17:54:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2660 states, 2321 states have (on average 1.4592847910383455) internal successors, (3387), 2348 states have internal predecessors, (3387), 204 states have call successors, (204), 106 states have call predecessors, (204), 133 states have return successors, (277), 214 states have call predecessors, (277), 202 states have call successors, (277) [2025-02-05 17:54:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3868 transitions. [2025-02-05 17:54:49,431 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3868 transitions. Word has length 112 [2025-02-05 17:54:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:49,432 INFO L471 AbstractCegarLoop]: Abstraction has 2660 states and 3868 transitions. [2025-02-05 17:54:49,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3868 transitions. [2025-02-05 17:54:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:49,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:49,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:49,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:54:49,434 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:49,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1569586955, now seen corresponding path program 1 times [2025-02-05 17:54:49,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:49,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822160952] [2025-02-05 17:54:49,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:49,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:49,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:49,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:49,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:49,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822160952] [2025-02-05 17:54:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822160952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:49,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868285654] [2025-02-05 17:54:49,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:49,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:49,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:49,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:49,539 INFO L87 Difference]: Start difference. First operand 2660 states and 3868 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:50,651 INFO L93 Difference]: Finished difference Result 7115 states and 10919 transitions. [2025-02-05 17:54:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:50,691 INFO L225 Difference]: With dead ends: 7115 [2025-02-05 17:54:50,691 INFO L226 Difference]: Without dead ends: 4977 [2025-02-05 17:54:50,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:54:50,698 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 775 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:50,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2060 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:54:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4977 states. [2025-02-05 17:54:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4977 to 4839. [2025-02-05 17:54:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4286 states have (on average 1.5088660755949603) internal successors, (6467), 4359 states have internal predecessors, (6467), 324 states have call successors, (324), 154 states have call predecessors, (324), 227 states have return successors, (589), 342 states have call predecessors, (589), 322 states have call successors, (589) [2025-02-05 17:54:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 7380 transitions. [2025-02-05 17:54:51,030 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 7380 transitions. Word has length 112 [2025-02-05 17:54:51,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:51,030 INFO L471 AbstractCegarLoop]: Abstraction has 4839 states and 7380 transitions. [2025-02-05 17:54:51,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 7380 transitions. [2025-02-05 17:54:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:51,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:51,034 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:51,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:54:51,035 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:51,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1755089334, now seen corresponding path program 1 times [2025-02-05 17:54:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:51,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136308501] [2025-02-05 17:54:51,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:51,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:51,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:51,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:51,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:51,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:51,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136308501] [2025-02-05 17:54:51,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136308501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:51,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:51,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:51,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050536356] [2025-02-05 17:54:51,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:51,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:51,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:51,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:51,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:51,155 INFO L87 Difference]: Start difference. First operand 4839 states and 7380 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:51,632 INFO L93 Difference]: Finished difference Result 9986 states and 15868 transitions. [2025-02-05 17:54:51,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:54:51,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:51,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:51,659 INFO L225 Difference]: With dead ends: 9986 [2025-02-05 17:54:51,660 INFO L226 Difference]: Without dead ends: 5669 [2025-02-05 17:54:51,668 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-02-05 17:54:51,668 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 606 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:51,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 835 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:54:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5669 states. [2025-02-05 17:54:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5669 to 4839. [2025-02-05 17:54:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4286 states have (on average 1.5048996733551097) internal successors, (6450), 4359 states have internal predecessors, (6450), 324 states have call successors, (324), 154 states have call predecessors, (324), 227 states have return successors, (589), 342 states have call predecessors, (589), 322 states have call successors, (589) [2025-02-05 17:54:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 7363 transitions. [2025-02-05 17:54:51,858 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 7363 transitions. Word has length 112 [2025-02-05 17:54:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:51,858 INFO L471 AbstractCegarLoop]: Abstraction has 4839 states and 7363 transitions. [2025-02-05 17:54:51,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 7363 transitions. [2025-02-05 17:54:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:51,861 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:51,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:51,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:54:51,862 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:51,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1601346347, now seen corresponding path program 1 times [2025-02-05 17:54:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:51,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922958201] [2025-02-05 17:54:51,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:51,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:51,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:51,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:51,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:51,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:51,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922958201] [2025-02-05 17:54:51,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922958201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:51,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:51,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595783858] [2025-02-05 17:54:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:51,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:51,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:51,927 INFO L87 Difference]: Start difference. First operand 4839 states and 7363 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:52,367 INFO L93 Difference]: Finished difference Result 9903 states and 15668 transitions. [2025-02-05 17:54:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:54:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:52,399 INFO L225 Difference]: With dead ends: 9903 [2025-02-05 17:54:52,399 INFO L226 Difference]: Without dead ends: 5586 [2025-02-05 17:54:52,408 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-02-05 17:54:52,408 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 603 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:52,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 827 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:54:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2025-02-05 17:54:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 4839. [2025-02-05 17:54:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4839 states, 4286 states have (on average 1.500933271115259) internal successors, (6433), 4359 states have internal predecessors, (6433), 324 states have call successors, (324), 154 states have call predecessors, (324), 227 states have return successors, (589), 342 states have call predecessors, (589), 322 states have call successors, (589) [2025-02-05 17:54:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 7346 transitions. [2025-02-05 17:54:52,619 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 7346 transitions. Word has length 112 [2025-02-05 17:54:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:52,620 INFO L471 AbstractCegarLoop]: Abstraction has 4839 states and 7346 transitions. [2025-02-05 17:54:52,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 7346 transitions. [2025-02-05 17:54:52,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:52,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:52,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:52,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:54:52,623 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:52,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1986713130, now seen corresponding path program 1 times [2025-02-05 17:54:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:52,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385854684] [2025-02-05 17:54:52,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:52,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:52,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:52,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:52,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:52,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:52,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385854684] [2025-02-05 17:54:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385854684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:52,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:52,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985406793] [2025-02-05 17:54:52,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:52,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:52,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:52,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:52,703 INFO L87 Difference]: Start difference. First operand 4839 states and 7346 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:53,510 INFO L93 Difference]: Finished difference Result 14786 states and 23468 transitions. [2025-02-05 17:54:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:53,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:53,539 INFO L225 Difference]: With dead ends: 14786 [2025-02-05 17:54:53,539 INFO L226 Difference]: Without dead ends: 10469 [2025-02-05 17:54:53,551 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-02-05 17:54:53,552 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 948 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:53,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1997 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:53,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10469 states. [2025-02-05 17:54:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10469 to 9500. [2025-02-05 17:54:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9500 states, 8481 states have (on average 1.5400306567621742) internal successors, (13061), 8700 states have internal predecessors, (13061), 548 states have call successors, (548), 250 states have call predecessors, (548), 469 states have return successors, (1581), 582 states have call predecessors, (1581), 546 states have call successors, (1581) [2025-02-05 17:54:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9500 states to 9500 states and 15190 transitions. [2025-02-05 17:54:54,159 INFO L78 Accepts]: Start accepts. Automaton has 9500 states and 15190 transitions. Word has length 112 [2025-02-05 17:54:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:54,159 INFO L471 AbstractCegarLoop]: Abstraction has 9500 states and 15190 transitions. [2025-02-05 17:54:54,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:54,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9500 states and 15190 transitions. [2025-02-05 17:54:54,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:54,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:54,166 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:54,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:54:54,166 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:54,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash -336576331, now seen corresponding path program 1 times [2025-02-05 17:54:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:54,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719336307] [2025-02-05 17:54:54,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:54,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:54,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:54,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:54,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719336307] [2025-02-05 17:54:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719336307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:54,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543694550] [2025-02-05 17:54:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:54,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:54,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:54,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:54,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:54,264 INFO L87 Difference]: Start difference. First operand 9500 states and 15190 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:55,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:55,423 INFO L93 Difference]: Finished difference Result 30411 states and 51094 transitions. [2025-02-05 17:54:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:55,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:55,524 INFO L225 Difference]: With dead ends: 30411 [2025-02-05 17:54:55,527 INFO L226 Difference]: Without dead ends: 21433 [2025-02-05 17:54:55,558 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-02-05 17:54:55,559 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 912 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:55,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1981 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21433 states. [2025-02-05 17:54:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21433 to 19635. [2025-02-05 17:54:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19635 states, 17538 states have (on average 1.5737826434028965) internal successors, (27601), 18211 states have internal predecessors, (27601), 980 states have call successors, (980), 442 states have call predecessors, (980), 1115 states have return successors, (5085), 1046 states have call predecessors, (5085), 978 states have call successors, (5085) [2025-02-05 17:54:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19635 states to 19635 states and 33666 transitions. [2025-02-05 17:54:56,547 INFO L78 Accepts]: Start accepts. Automaton has 19635 states and 33666 transitions. Word has length 112 [2025-02-05 17:54:56,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:56,547 INFO L471 AbstractCegarLoop]: Abstraction has 19635 states and 33666 transitions. [2025-02-05 17:54:56,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:56,548 INFO L276 IsEmpty]: Start isEmpty. Operand 19635 states and 33666 transitions. [2025-02-05 17:54:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:54:56,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:56,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:56,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:54:56,556 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:56,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1517769206, now seen corresponding path program 1 times [2025-02-05 17:54:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:56,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704282658] [2025-02-05 17:54:56,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:56,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:56,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:54:56,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:54:56,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:56,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:56,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:56,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704282658] [2025-02-05 17:54:56,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704282658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:56,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:56,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:56,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005242975] [2025-02-05 17:54:56,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:56,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:56,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:56,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:56,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:56,670 INFO L87 Difference]: Start difference. First operand 19635 states and 33666 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:59,719 INFO L93 Difference]: Finished difference Result 64510 states and 118132 transitions. [2025-02-05 17:54:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:59,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:54:59,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:59,884 INFO L225 Difference]: With dead ends: 64510 [2025-02-05 17:54:59,885 INFO L226 Difference]: Without dead ends: 45397 [2025-02-05 17:54:59,934 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-02-05 17:54:59,935 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 878 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:59,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1973 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:54:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45397 states. [2025-02-05 17:55:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45397 to 42674. [2025-02-05 17:55:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42674 states, 37967 states have (on average 1.6003634735428134) internal successors, (60761), 40034 states have internal predecessors, (60761), 1812 states have call successors, (1812), 826 states have call predecessors, (1812), 2893 states have return successors, (18205), 1942 states have call predecessors, (18205), 1810 states have call successors, (18205) [2025-02-05 17:55:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42674 states to 42674 states and 80778 transitions. [2025-02-05 17:55:02,314 INFO L78 Accepts]: Start accepts. Automaton has 42674 states and 80778 transitions. Word has length 112 [2025-02-05 17:55:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:02,315 INFO L471 AbstractCegarLoop]: Abstraction has 42674 states and 80778 transitions. [2025-02-05 17:55:02,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 42674 states and 80778 transitions. [2025-02-05 17:55:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:55:02,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:02,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:02,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:55:02,332 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:02,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1609001835, now seen corresponding path program 1 times [2025-02-05 17:55:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175303572] [2025-02-05 17:55:02,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:02,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:02,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:55:02,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:55:02,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:02,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175303572] [2025-02-05 17:55:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175303572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:02,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:02,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:02,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297864171] [2025-02-05 17:55:02,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:02,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:02,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:02,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:02,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:02,431 INFO L87 Difference]: Start difference. First operand 42674 states and 80778 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:09,092 INFO L93 Difference]: Finished difference Result 141657 states and 295090 transitions. [2025-02-05 17:55:09,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:09,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 112 [2025-02-05 17:55:09,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:09,953 INFO L225 Difference]: With dead ends: 141657 [2025-02-05 17:55:09,953 INFO L226 Difference]: Without dead ends: 99505 [2025-02-05 17:55:10,074 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-02-05 17:55:10,078 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 843 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:10,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1961 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99505 states. [2025-02-05 17:55:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99505 to 95121. [2025-02-05 17:55:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95121 states, 83800 states have (on average 1.618579952267303) internal successors, (135637), 90113 states have internal predecessors, (135637), 3412 states have call successors, (3412), 1594 states have call predecessors, (3412), 7907 states have return successors, (68957), 3670 states have call predecessors, (68957), 3410 states have call successors, (68957) [2025-02-05 17:55:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95121 states to 95121 states and 208006 transitions. [2025-02-05 17:55:16,275 INFO L78 Accepts]: Start accepts. Automaton has 95121 states and 208006 transitions. Word has length 112 [2025-02-05 17:55:16,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:16,275 INFO L471 AbstractCegarLoop]: Abstraction has 95121 states and 208006 transitions. [2025-02-05 17:55:16,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 95121 states and 208006 transitions. [2025-02-05 17:55:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:55:16,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:16,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:55:16,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:55:16,305 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:16,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1476723222, now seen corresponding path program 1 times [2025-02-05 17:55:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:16,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140244750] [2025-02-05 17:55:16,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:16,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:55:16,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:55:16,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:16,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140244750] [2025-02-05 17:55:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140244750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:16,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:16,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:16,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760500902] [2025-02-05 17:55:16,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:16,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:16,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:16,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:16,380 INFO L87 Difference]: Start difference. First operand 95121 states and 208006 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)