./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:21:13,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:21:13,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:21:13,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:21:13,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:21:13,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:21:13,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:21:13,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:21:13,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:21:13,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:21:13,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:21:13,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:21:13,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:21:13,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:21:13,849 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:21:13,850 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:21:13,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:21:13,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:21:13,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:21:13,851 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c3aab1156afcb98b97b027e9b66004d54025f3b89e95d6d35dc2e84fdb640d2 [2025-03-03 16:21:14,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:21:14,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:21:14,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:21:14,145 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:21:14,145 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:21:14,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2025-03-03 16:21:15,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939de97ae/8ba6fe709173413bab92453afb723411/FLAG4ef0bb625 [2025-03-03 16:21:15,453 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:21:15,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2025-03-03 16:21:15,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939de97ae/8ba6fe709173413bab92453afb723411/FLAG4ef0bb625 [2025-03-03 16:21:15,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939de97ae/8ba6fe709173413bab92453afb723411 [2025-03-03 16:21:15,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:21:15,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:21:15,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:21:15,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:21:15,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:21:15,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b9ba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15, skipping insertion in model container [2025-03-03 16:21:15,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:21:15,622 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2025-03-03 16:21:15,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2025-03-03 16:21:15,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:21:15,723 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:21:15,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2025-03-03 16:21:15,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2025-03-03 16:21:15,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:21:15,799 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:21:15,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15 WrapperNode [2025-03-03 16:21:15,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:21:15,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:21:15,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:21:15,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:21:15,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,811 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,829 INFO L138 Inliner]: procedures = 59, calls = 66, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 498 [2025-03-03 16:21:15,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:21:15,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:21:15,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:21:15,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:21:15,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,856 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:21:15,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,862 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:21:15,871 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:21:15,871 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:21:15,871 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:21:15,872 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (1/1) ... [2025-03-03 16:21:15,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:21:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:21:15,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:21:15,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:21:15,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:21:15,921 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:21:15,921 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:21:15,922 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:21:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:21:15,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:21:15,922 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:21:15,922 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:21:15,989 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:21:15,991 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:21:16,445 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-03 16:21:16,445 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:21:16,460 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:21:16,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:21:16,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:21:16 BoogieIcfgContainer [2025-03-03 16:21:16,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:21:16,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:21:16,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:21:16,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:21:16,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:21:15" (1/3) ... [2025-03-03 16:21:16,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2d78aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:21:16, skipping insertion in model container [2025-03-03 16:21:16,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:21:15" (2/3) ... [2025-03-03 16:21:16,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2d78aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:21:16, skipping insertion in model container [2025-03-03 16:21:16,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:21:16" (3/3) ... [2025-03-03 16:21:16,470 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2025-03-03 16:21:16,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:21:16,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.c that has 15 procedures, 268 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-03-03 16:21:16,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:21:16,526 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;@14fe78ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:21:16,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:21:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 268 states, 220 states have (on average 1.5) internal successors, (330), 226 states have internal predecessors, (330), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-03 16:21:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:16,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:16,540 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-03-03 16:21:16,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:16,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash 235399185, now seen corresponding path program 1 times [2025-03-03 16:21:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:16,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64092446] [2025-03-03 16:21:16,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:16,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:16,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:16,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:16,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:16,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:16,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64092446] [2025-03-03 16:21:16,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64092446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:16,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:16,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:21:16,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99042447] [2025-03-03 16:21:16,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:16,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:21:16,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:16,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:21:16,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:16,757 INFO L87 Difference]: Start difference. First operand has 268 states, 220 states have (on average 1.5) internal successors, (330), 226 states have internal predecessors, (330), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) 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-03-03 16:21:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:16,807 INFO L93 Difference]: Finished difference Result 518 states and 755 transitions. [2025-03-03 16:21:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:21:16,811 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-03-03 16:21:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:16,817 INFO L225 Difference]: With dead ends: 518 [2025-03-03 16:21:16,817 INFO L226 Difference]: Without dead ends: 258 [2025-03-03 16:21:16,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:16,821 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 133 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:16,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 613 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-03 16:21:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2025-03-03 16:21:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 212 states have (on average 1.4481132075471699) internal successors, (307), 216 states have internal predecessors, (307), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 16:21:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 367 transitions. [2025-03-03 16:21:16,878 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 367 transitions. Word has length 65 [2025-03-03 16:21:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:16,880 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 367 transitions. [2025-03-03 16:21:16,880 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-03-03 16:21:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 367 transitions. [2025-03-03 16:21:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:16,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:16,883 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-03-03 16:21:16,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:21:16,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:16,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash 215061810, now seen corresponding path program 1 times [2025-03-03 16:21:16,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:16,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895359618] [2025-03-03 16:21:16,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:16,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:16,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:16,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:16,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:16,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895359618] [2025-03-03 16:21:17,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895359618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:17,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:17,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:21:17,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309618367] [2025-03-03 16:21:17,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:17,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:21:17,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:17,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:21:17,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:21:17,094 INFO L87 Difference]: Start difference. First operand 258 states and 367 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-03-03 16:21:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:17,573 INFO L93 Difference]: Finished difference Result 453 states and 639 transitions. [2025-03-03 16:21:17,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:21:17,573 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-03-03 16:21:17,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:17,580 INFO L225 Difference]: With dead ends: 453 [2025-03-03 16:21:17,580 INFO L226 Difference]: Without dead ends: 363 [2025-03-03 16:21:17,581 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-03-03 16:21:17,581 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 296 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:17,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 829 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-03 16:21:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 356. [2025-03-03 16:21:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 290 states have (on average 1.4241379310344828) internal successors, (413), 296 states have internal predecessors, (413), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (45), 41 states have call predecessors, (45), 40 states have call successors, (45) [2025-03-03 16:21:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 500 transitions. [2025-03-03 16:21:17,605 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 500 transitions. Word has length 65 [2025-03-03 16:21:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:17,606 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 500 transitions. [2025-03-03 16:21:17,606 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-03-03 16:21:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 500 transitions. [2025-03-03 16:21:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:17,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:17,608 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-03-03 16:21:17,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:21:17,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:17,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1220278161, now seen corresponding path program 1 times [2025-03-03 16:21:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:17,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197662874] [2025-03-03 16:21:17,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:17,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:17,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:17,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:17,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:17,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:17,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197662874] [2025-03-03 16:21:17,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197662874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:17,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:17,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:17,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582670899] [2025-03-03 16:21:17,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:17,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:17,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:17,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:17,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:17,778 INFO L87 Difference]: Start difference. First operand 356 states and 500 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-03-03 16:21:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:18,262 INFO L93 Difference]: Finished difference Result 679 states and 936 transitions. [2025-03-03 16:21:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:18,263 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-03-03 16:21:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:18,266 INFO L225 Difference]: With dead ends: 679 [2025-03-03 16:21:18,266 INFO L226 Difference]: Without dead ends: 498 [2025-03-03 16:21:18,268 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-03-03 16:21:18,270 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 546 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:18,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1080 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-03 16:21:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 454. [2025-03-03 16:21:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 368 states have (on average 1.4076086956521738) internal successors, (518), 376 states have internal predecessors, (518), 53 states have call successors, (53), 28 states have call predecessors, (53), 31 states have return successors, (64), 53 states have call predecessors, (64), 51 states have call successors, (64) [2025-03-03 16:21:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 635 transitions. [2025-03-03 16:21:18,321 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 635 transitions. Word has length 65 [2025-03-03 16:21:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:18,321 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 635 transitions. [2025-03-03 16:21:18,321 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-03-03 16:21:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 635 transitions. [2025-03-03 16:21:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:18,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:18,325 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-03-03 16:21:18,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:21:18,325 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:18,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash -87087568, now seen corresponding path program 1 times [2025-03-03 16:21:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215443854] [2025-03-03 16:21:18,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:18,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:18,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:18,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:18,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:18,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:18,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215443854] [2025-03-03 16:21:18,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215443854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:18,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:18,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:18,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322980035] [2025-03-03 16:21:18,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:18,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:18,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:18,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:18,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:18,449 INFO L87 Difference]: Start difference. First operand 454 states and 635 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-03-03 16:21:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:18,512 INFO L93 Difference]: Finished difference Result 732 states and 1014 transitions. [2025-03-03 16:21:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:21:18,513 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-03-03 16:21:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:18,516 INFO L225 Difference]: With dead ends: 732 [2025-03-03 16:21:18,516 INFO L226 Difference]: Without dead ends: 459 [2025-03-03 16:21:18,518 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-03-03 16:21:18,521 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1815 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-03-03 16:21:18,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1815 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-03 16:21:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2025-03-03 16:21:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 372 states have (on average 1.3978494623655915) internal successors, (520), 380 states have internal predecessors, (520), 53 states have call successors, (53), 28 states have call predecessors, (53), 32 states have return successors, (65), 54 states have call predecessors, (65), 51 states have call successors, (65) [2025-03-03 16:21:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 638 transitions. [2025-03-03 16:21:18,555 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 638 transitions. Word has length 65 [2025-03-03 16:21:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:18,555 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 638 transitions. [2025-03-03 16:21:18,556 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-03-03 16:21:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 638 transitions. [2025-03-03 16:21:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:21:18,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:18,557 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-03-03 16:21:18,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:21:18,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:18,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:18,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1545716431, now seen corresponding path program 1 times [2025-03-03 16:21:18,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:18,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-03 16:21:18,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:18,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:18,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:21:18,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:21:18,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:18,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410511436] [2025-03-03 16:21:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410511436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:18,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:18,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:21:18,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944446822] [2025-03-03 16:21:18,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:18,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:21:18,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:18,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:21:18,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:21:18,656 INFO L87 Difference]: Start difference. First operand 459 states and 638 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-03-03 16:21:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:19,480 INFO L93 Difference]: Finished difference Result 1727 states and 2359 transitions. [2025-03-03 16:21:19,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:21:19,481 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-03-03 16:21:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:19,498 INFO L225 Difference]: With dead ends: 1727 [2025-03-03 16:21:19,498 INFO L226 Difference]: Without dead ends: 1431 [2025-03-03 16:21:19,499 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-03-03 16:21:19,501 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1774 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1788 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:19,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1788 Valid, 1256 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:21:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2025-03-03 16:21:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1377. [2025-03-03 16:21:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1104 states have (on average 1.338768115942029) internal successors, (1478), 1127 states have internal predecessors, (1478), 141 states have call successors, (141), 111 states have call predecessors, (141), 130 states have return successors, (179), 141 states have call predecessors, (179), 139 states have call successors, (179) [2025-03-03 16:21:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1798 transitions. [2025-03-03 16:21:19,590 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1798 transitions. Word has length 65 [2025-03-03 16:21:19,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:19,591 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1798 transitions. [2025-03-03 16:21:19,591 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-03-03 16:21:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1798 transitions. [2025-03-03 16:21:19,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:21:19,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:19,592 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-03-03 16:21:19,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:21:19,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:19,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -820504611, now seen corresponding path program 1 times [2025-03-03 16:21:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869475773] [2025-03-03 16:21:19,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:19,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:19,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:21:19,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:21:19,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:19,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:19,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:19,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869475773] [2025-03-03 16:21:19,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869475773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:19,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:19,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727882739] [2025-03-03 16:21:19,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:19,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:19,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:19,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:19,643 INFO L87 Difference]: Start difference. First operand 1377 states and 1798 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-03-03 16:21:19,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:19,728 INFO L93 Difference]: Finished difference Result 2615 states and 3399 transitions. [2025-03-03 16:21:19,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:21:19,729 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-03-03 16:21:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:19,735 INFO L225 Difference]: With dead ends: 2615 [2025-03-03 16:21:19,735 INFO L226 Difference]: Without dead ends: 1407 [2025-03-03 16:21:19,738 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-03-03 16:21:19,739 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1815 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-03-03 16:21:19,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1815 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-03-03 16:21:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2025-03-03 16:21:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1128 states have (on average 1.324468085106383) internal successors, (1494), 1151 states have internal predecessors, (1494), 141 states have call successors, (141), 111 states have call predecessors, (141), 136 states have return successors, (185), 147 states have call predecessors, (185), 139 states have call successors, (185) [2025-03-03 16:21:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1820 transitions. [2025-03-03 16:21:19,815 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1820 transitions. Word has length 66 [2025-03-03 16:21:19,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:19,815 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 1820 transitions. [2025-03-03 16:21:19,815 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-03-03 16:21:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1820 transitions. [2025-03-03 16:21:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:21:19,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:19,816 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-03-03 16:21:19,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:21:19,816 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:19,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash -809188484, now seen corresponding path program 1 times [2025-03-03 16:21:19,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:19,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635687790] [2025-03-03 16:21:19,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:19,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:19,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:21:19,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:21:19,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:19,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:19,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:19,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635687790] [2025-03-03 16:21:19,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635687790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:19,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:19,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:19,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924158037] [2025-03-03 16:21:19,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:19,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:19,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:19,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:19,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:19,919 INFO L87 Difference]: Start difference. First operand 1407 states and 1820 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-03-03 16:21:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:20,418 INFO L93 Difference]: Finished difference Result 2639 states and 3336 transitions. [2025-03-03 16:21:20,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:21:20,418 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-03-03 16:21:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:20,425 INFO L225 Difference]: With dead ends: 2639 [2025-03-03 16:21:20,425 INFO L226 Difference]: Without dead ends: 1629 [2025-03-03 16:21:20,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:21:20,428 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 531 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:20,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 863 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-03-03 16:21:20,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1348. [2025-03-03 16:21:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1085 states have (on average 1.319815668202765) internal successors, (1432), 1103 states have internal predecessors, (1432), 135 states have call successors, (135), 106 states have call predecessors, (135), 126 states have return successors, (170), 140 states have call predecessors, (170), 133 states have call successors, (170) [2025-03-03 16:21:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1737 transitions. [2025-03-03 16:21:20,502 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1737 transitions. Word has length 66 [2025-03-03 16:21:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:20,502 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1737 transitions. [2025-03-03 16:21:20,502 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-03-03 16:21:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1737 transitions. [2025-03-03 16:21:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:21:20,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:20,503 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-03-03 16:21:20,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:21:20,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:20,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1408569469, now seen corresponding path program 1 times [2025-03-03 16:21:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:20,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629147502] [2025-03-03 16:21:20,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:20,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:20,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:21:20,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:21:20,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:20,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:20,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:20,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629147502] [2025-03-03 16:21:20,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629147502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:20,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:21:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703582779] [2025-03-03 16:21:20,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:20,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:21:20,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:20,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:21:20,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:21:20,549 INFO L87 Difference]: Start difference. First operand 1348 states and 1737 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-03-03 16:21:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:20,903 INFO L93 Difference]: Finished difference Result 3594 states and 4587 transitions. [2025-03-03 16:21:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:21:20,903 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-03-03 16:21:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:20,915 INFO L225 Difference]: With dead ends: 3594 [2025-03-03 16:21:20,915 INFO L226 Difference]: Without dead ends: 2416 [2025-03-03 16:21:20,918 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-03-03 16:21:20,919 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 489 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:20,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 445 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:21:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2025-03-03 16:21:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2412. [2025-03-03 16:21:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2412 states, 1909 states have (on average 1.2713462545835517) internal successors, (2427), 1943 states have internal predecessors, (2427), 251 states have call successors, (251), 205 states have call predecessors, (251), 250 states have return successors, (358), 265 states have call predecessors, (358), 249 states have call successors, (358) [2025-03-03 16:21:21,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3036 transitions. [2025-03-03 16:21:21,077 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3036 transitions. Word has length 66 [2025-03-03 16:21:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:21,077 INFO L471 AbstractCegarLoop]: Abstraction has 2412 states and 3036 transitions. [2025-03-03 16:21:21,078 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-03-03 16:21:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3036 transitions. [2025-03-03 16:21:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:21:21,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:21,078 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-03-03 16:21:21,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:21:21,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:21,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:21,079 INFO L85 PathProgramCache]: Analyzing trace with hash 524754727, now seen corresponding path program 1 times [2025-03-03 16:21:21,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:21,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803311275] [2025-03-03 16:21:21,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:21,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:21,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:21:21,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:21:21,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:21,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:21,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:21,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803311275] [2025-03-03 16:21:21,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803311275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:21,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:21,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:21:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502591057] [2025-03-03 16:21:21,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:21,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:21:21,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:21,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:21:21,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:21,114 INFO L87 Difference]: Start difference. First operand 2412 states and 3036 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-03-03 16:21:21,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:21,283 INFO L93 Difference]: Finished difference Result 5511 states and 6924 transitions. [2025-03-03 16:21:21,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:21:21,284 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-03-03 16:21:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:21,298 INFO L225 Difference]: With dead ends: 5511 [2025-03-03 16:21:21,298 INFO L226 Difference]: Without dead ends: 3269 [2025-03-03 16:21:21,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:21,303 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 102 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:21,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 716 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2025-03-03 16:21:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3189. [2025-03-03 16:21:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3189 states, 2515 states have (on average 1.2612326043737574) internal successors, (3172), 2554 states have internal predecessors, (3172), 335 states have call successors, (335), 278 states have call predecessors, (335), 337 states have return successors, (462), 358 states have call predecessors, (462), 333 states have call successors, (462) [2025-03-03 16:21:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 3969 transitions. [2025-03-03 16:21:21,478 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 3969 transitions. Word has length 67 [2025-03-03 16:21:21,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:21,478 INFO L471 AbstractCegarLoop]: Abstraction has 3189 states and 3969 transitions. [2025-03-03 16:21:21,478 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-03-03 16:21:21,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 3969 transitions. [2025-03-03 16:21:21,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:21:21,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:21,479 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-03-03 16:21:21,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:21:21,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:21,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:21,480 INFO L85 PathProgramCache]: Analyzing trace with hash 894779843, now seen corresponding path program 1 times [2025-03-03 16:21:21,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:21,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939330263] [2025-03-03 16:21:21,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:21,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:21:21,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:21:21,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:21,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:21,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:21,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939330263] [2025-03-03 16:21:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939330263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:21,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:21,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:21:21,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275860501] [2025-03-03 16:21:21,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:21,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:21:21,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:21,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:21:21,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:21,506 INFO L87 Difference]: Start difference. First operand 3189 states and 3969 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-03-03 16:21:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:21,658 INFO L93 Difference]: Finished difference Result 6548 states and 8104 transitions. [2025-03-03 16:21:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:21:21,658 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-03-03 16:21:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:21,674 INFO L225 Difference]: With dead ends: 6548 [2025-03-03 16:21:21,675 INFO L226 Difference]: Without dead ends: 3528 [2025-03-03 16:21:21,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:21,681 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 331 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:21,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 500 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2025-03-03 16:21:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3467. [2025-03-03 16:21:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3467 states, 2736 states have (on average 1.2558479532163742) internal successors, (3436), 2777 states have internal predecessors, (3436), 363 states have call successors, (363), 303 states have call predecessors, (363), 366 states have return successors, (494), 388 states have call predecessors, (494), 361 states have call successors, (494) [2025-03-03 16:21:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3467 states to 3467 states and 4293 transitions. [2025-03-03 16:21:21,895 INFO L78 Accepts]: Start accepts. Automaton has 3467 states and 4293 transitions. Word has length 73 [2025-03-03 16:21:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:21,895 INFO L471 AbstractCegarLoop]: Abstraction has 3467 states and 4293 transitions. [2025-03-03 16:21:21,895 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-03-03 16:21:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3467 states and 4293 transitions. [2025-03-03 16:21:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:21:21,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:21,896 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:21,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:21:21,897 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:21,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1561903552, now seen corresponding path program 1 times [2025-03-03 16:21:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:21,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370871189] [2025-03-03 16:21:21,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:21,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:21:21,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:21:21,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:21,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:21,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:21,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370871189] [2025-03-03 16:21:21,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370871189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:21,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:21,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:21:21,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922368827] [2025-03-03 16:21:21,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:21,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:21:21,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:21,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:21:21,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:21:21,994 INFO L87 Difference]: Start difference. First operand 3467 states and 4293 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:21:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:22,442 INFO L93 Difference]: Finished difference Result 4266 states and 5261 transitions. [2025-03-03 16:21:22,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:21:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2025-03-03 16:21:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:22,462 INFO L225 Difference]: With dead ends: 4266 [2025-03-03 16:21:22,463 INFO L226 Difference]: Without dead ends: 4263 [2025-03-03 16:21:22,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-03 16:21:22,465 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 661 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:22,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 483 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:21:22,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4263 states. [2025-03-03 16:21:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4263 to 3929. [2025-03-03 16:21:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3929 states, 3091 states have (on average 1.2471692009058557) internal successors, (3855), 3135 states have internal predecessors, (3855), 413 states have call successors, (413), 347 states have call predecessors, (413), 423 states have return successors, (571), 448 states have call predecessors, (571), 412 states have call successors, (571) [2025-03-03 16:21:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 4839 transitions. [2025-03-03 16:21:22,769 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 4839 transitions. Word has length 75 [2025-03-03 16:21:22,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:22,769 INFO L471 AbstractCegarLoop]: Abstraction has 3929 states and 4839 transitions. [2025-03-03 16:21:22,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:21:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 4839 transitions. [2025-03-03 16:21:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 16:21:22,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:22,771 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:22,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:21:22,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:22,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:22,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1174038546, now seen corresponding path program 1 times [2025-03-03 16:21:22,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:22,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103182786] [2025-03-03 16:21:22,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:22,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:22,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:21:22,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:21:22,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:22,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:22,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:22,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:22,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103182786] [2025-03-03 16:21:22,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103182786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:21:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448461105] [2025-03-03 16:21:22,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:22,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:21:22,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:21:22,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:21:22,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:21:22,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:21:22,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:21:22,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:22,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:22,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:21:22,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:21:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:23,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:21:23,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:23,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448461105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:21:23,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:21:23,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-03 16:21:23,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747301177] [2025-03-03 16:21:23,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:21:23,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:21:23,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:23,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:21:23,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:21:23,219 INFO L87 Difference]: Start difference. First operand 3929 states and 4839 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:21:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:23,794 INFO L93 Difference]: Finished difference Result 7780 states and 9516 transitions. [2025-03-03 16:21:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:21:23,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 76 [2025-03-03 16:21:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:23,833 INFO L225 Difference]: With dead ends: 7780 [2025-03-03 16:21:23,834 INFO L226 Difference]: Without dead ends: 7777 [2025-03-03 16:21:23,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:21:23,840 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 958 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:23,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1592 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:21:23,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7777 states. [2025-03-03 16:21:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7777 to 7372. [2025-03-03 16:21:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7372 states, 5792 states have (on average 1.236878453038674) internal successors, (7164), 5871 states have internal predecessors, (7164), 772 states have call successors, (772), 661 states have call predecessors, (772), 806 states have return successors, (1072), 841 states have call predecessors, (1072), 771 states have call successors, (1072) [2025-03-03 16:21:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7372 states to 7372 states and 9008 transitions. [2025-03-03 16:21:24,391 INFO L78 Accepts]: Start accepts. Automaton has 7372 states and 9008 transitions. Word has length 76 [2025-03-03 16:21:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:24,391 INFO L471 AbstractCegarLoop]: Abstraction has 7372 states and 9008 transitions. [2025-03-03 16:21:24,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:21:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 7372 states and 9008 transitions. [2025-03-03 16:21:24,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:24,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:24,393 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:24,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 16:21:24,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 16:21:24,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:24,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:24,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1877540126, now seen corresponding path program 2 times [2025-03-03 16:21:24,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:24,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911424034] [2025-03-03 16:21:24,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:21:24,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:24,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-03 16:21:24,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:24,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 16:21:24,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:24,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911424034] [2025-03-03 16:21:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911424034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:24,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:24,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:21:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398723960] [2025-03-03 16:21:24,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:24,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:21:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:24,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:21:24,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:24,630 INFO L87 Difference]: Start difference. First operand 7372 states and 9008 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:21:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:24,819 INFO L93 Difference]: Finished difference Result 9797 states and 12031 transitions. [2025-03-03 16:21:24,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:21:24,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2025-03-03 16:21:24,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:24,836 INFO L225 Difference]: With dead ends: 9797 [2025-03-03 16:21:24,836 INFO L226 Difference]: Without dead ends: 3573 [2025-03-03 16:21:24,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:21:24,849 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 336 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:24,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 554 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:21:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2025-03-03 16:21:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 2770. [2025-03-03 16:21:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2194 states have (on average 1.2333637192342752) internal successors, (2706), 2219 states have internal predecessors, (2706), 292 states have call successors, (292), 244 states have call predecessors, (292), 282 states have return successors, (373), 308 states have call predecessors, (373), 291 states have call successors, (373) [2025-03-03 16:21:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3371 transitions. [2025-03-03 16:21:25,042 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3371 transitions. Word has length 79 [2025-03-03 16:21:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:25,043 INFO L471 AbstractCegarLoop]: Abstraction has 2770 states and 3371 transitions. [2025-03-03 16:21:25,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:21:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3371 transitions. [2025-03-03 16:21:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:25,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:25,045 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] [2025-03-03 16:21:25,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:21:25,045 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:25,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash 695320072, now seen corresponding path program 1 times [2025-03-03 16:21:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:25,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250397753] [2025-03-03 16:21:25,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:25,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:21:25,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:25,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:25,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:25,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:25,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:25,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250397753] [2025-03-03 16:21:25,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250397753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:25,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:25,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:21:25,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824377247] [2025-03-03 16:21:25,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:25,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:21:25,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:25,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:21:25,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:21:25,099 INFO L87 Difference]: Start difference. First operand 2770 states and 3371 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:25,501 INFO L93 Difference]: Finished difference Result 3080 states and 3831 transitions. [2025-03-03 16:21:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:21:25,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2025-03-03 16:21:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:25,518 INFO L225 Difference]: With dead ends: 3080 [2025-03-03 16:21:25,518 INFO L226 Difference]: Without dead ends: 2931 [2025-03-03 16:21:25,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:25,520 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 562 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:25,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 806 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:21:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2025-03-03 16:21:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2920. [2025-03-03 16:21:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2325 states have (on average 1.247741935483871) internal successors, (2901), 2351 states have internal predecessors, (2901), 304 states have call successors, (304), 250 states have call predecessors, (304), 289 states have return successors, (386), 320 states have call predecessors, (386), 303 states have call successors, (386) [2025-03-03 16:21:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 3591 transitions. [2025-03-03 16:21:25,687 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 3591 transitions. Word has length 79 [2025-03-03 16:21:25,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:25,687 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 3591 transitions. [2025-03-03 16:21:25,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 3591 transitions. [2025-03-03 16:21:25,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:25,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:25,690 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] [2025-03-03 16:21:25,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:21:25,690 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:25,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1333639478, now seen corresponding path program 1 times [2025-03-03 16:21:25,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:25,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580227357] [2025-03-03 16:21:25,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:25,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:25,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:21:25,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:25,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:25,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:25,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:25,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580227357] [2025-03-03 16:21:25,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580227357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:25,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:25,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:25,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50609828] [2025-03-03 16:21:25,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:25,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:25,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:25,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:25,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:25,770 INFO L87 Difference]: Start difference. First operand 2920 states and 3591 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:26,322 INFO L93 Difference]: Finished difference Result 3403 states and 4308 transitions. [2025-03-03 16:21:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:26,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:21:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:26,334 INFO L225 Difference]: With dead ends: 3403 [2025-03-03 16:21:26,334 INFO L226 Difference]: Without dead ends: 3104 [2025-03-03 16:21:26,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:21:26,336 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 554 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:26,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1414 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2025-03-03 16:21:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 3061. [2025-03-03 16:21:26,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3061 states, 2447 states have (on average 1.2578667756436452) internal successors, (3078), 2474 states have internal predecessors, (3078), 316 states have call successors, (316), 256 states have call predecessors, (316), 296 states have return successors, (401), 333 states have call predecessors, (401), 315 states have call successors, (401) [2025-03-03 16:21:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 3795 transitions. [2025-03-03 16:21:26,541 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 3795 transitions. Word has length 79 [2025-03-03 16:21:26,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:26,541 INFO L471 AbstractCegarLoop]: Abstraction has 3061 states and 3795 transitions. [2025-03-03 16:21:26,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:26,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 3795 transitions. [2025-03-03 16:21:26,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:26,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:26,543 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] [2025-03-03 16:21:26,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:21:26,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:26,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:26,544 INFO L85 PathProgramCache]: Analyzing trace with hash 786647721, now seen corresponding path program 1 times [2025-03-03 16:21:26,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:26,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791422375] [2025-03-03 16:21:26,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:26,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:26,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:21:26,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:26,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:26,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:26,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:26,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791422375] [2025-03-03 16:21:26,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791422375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:26,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:26,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:26,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427232687] [2025-03-03 16:21:26,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:26,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:26,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:26,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:26,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:26,630 INFO L87 Difference]: Start difference. First operand 3061 states and 3795 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:27,180 INFO L93 Difference]: Finished difference Result 3842 states and 4951 transitions. [2025-03-03 16:21:27,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:21:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:27,194 INFO L225 Difference]: With dead ends: 3842 [2025-03-03 16:21:27,194 INFO L226 Difference]: Without dead ends: 3402 [2025-03-03 16:21:27,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:21:27,197 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 549 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:27,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1398 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2025-03-03 16:21:27,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3356. [2025-03-03 16:21:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 2702 states have (on average 1.2772020725388602) internal successors, (3451), 2733 states have internal predecessors, (3451), 340 states have call successors, (340), 268 states have call predecessors, (340), 312 states have return successors, (437), 359 states have call predecessors, (437), 339 states have call successors, (437) [2025-03-03 16:21:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4228 transitions. [2025-03-03 16:21:27,566 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 4228 transitions. Word has length 79 [2025-03-03 16:21:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:27,566 INFO L471 AbstractCegarLoop]: Abstraction has 3356 states and 4228 transitions. [2025-03-03 16:21:27,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 4228 transitions. [2025-03-03 16:21:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:27,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:27,568 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] [2025-03-03 16:21:27,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:21:27,568 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:27,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:27,569 INFO L85 PathProgramCache]: Analyzing trace with hash 577949418, now seen corresponding path program 1 times [2025-03-03 16:21:27,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:27,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882099243] [2025-03-03 16:21:27,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:27,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:21:27,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:27,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:27,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:27,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:27,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:27,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882099243] [2025-03-03 16:21:27,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882099243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:27,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:27,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:27,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608131455] [2025-03-03 16:21:27,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:27,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:27,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:27,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:27,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:27,653 INFO L87 Difference]: Start difference. First operand 3356 states and 4228 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:28,331 INFO L93 Difference]: Finished difference Result 4767 states and 6334 transitions. [2025-03-03 16:21:28,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:28,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:21:28,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:28,344 INFO L225 Difference]: With dead ends: 4767 [2025-03-03 16:21:28,344 INFO L226 Difference]: Without dead ends: 4032 [2025-03-03 16:21:28,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:21:28,348 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 544 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:28,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1386 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2025-03-03 16:21:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 3979. [2025-03-03 16:21:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3979 states, 3239 states have (on average 1.309972213646187) internal successors, (4243), 3284 states have internal predecessors, (4243), 388 states have call successors, (388), 292 states have call predecessors, (388), 350 states have return successors, (533), 411 states have call predecessors, (533), 387 states have call successors, (533) [2025-03-03 16:21:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3979 states to 3979 states and 5164 transitions. [2025-03-03 16:21:28,599 INFO L78 Accepts]: Start accepts. Automaton has 3979 states and 5164 transitions. Word has length 79 [2025-03-03 16:21:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:28,600 INFO L471 AbstractCegarLoop]: Abstraction has 3979 states and 5164 transitions. [2025-03-03 16:21:28,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3979 states and 5164 transitions. [2025-03-03 16:21:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:28,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:28,601 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] [2025-03-03 16:21:28,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:21:28,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:28,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1229898103, now seen corresponding path program 1 times [2025-03-03 16:21:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:28,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997049220] [2025-03-03 16:21:28,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:28,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:21:28,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:28,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:28,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:28,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997049220] [2025-03-03 16:21:28,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997049220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:28,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:28,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:28,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367404313] [2025-03-03 16:21:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:28,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:28,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:28,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:28,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:28,680 INFO L87 Difference]: Start difference. First operand 3979 states and 5164 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:29,358 INFO L93 Difference]: Finished difference Result 6938 states and 9673 transitions. [2025-03-03 16:21:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:29,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:21:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:29,376 INFO L225 Difference]: With dead ends: 6938 [2025-03-03 16:21:29,376 INFO L226 Difference]: Without dead ends: 5580 [2025-03-03 16:21:29,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:21:29,378 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 643 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:29,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1361 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5580 states. [2025-03-03 16:21:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5580 to 5282. [2025-03-03 16:21:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5282 states, 4360 states have (on average 1.356651376146789) internal successors, (5915), 4451 states have internal predecessors, (5915), 476 states have call successors, (476), 340 states have call predecessors, (476), 444 states have return successors, (813), 507 states have call predecessors, (813), 475 states have call successors, (813) [2025-03-03 16:21:29,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5282 states to 5282 states and 7204 transitions. [2025-03-03 16:21:29,639 INFO L78 Accepts]: Start accepts. Automaton has 5282 states and 7204 transitions. Word has length 79 [2025-03-03 16:21:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:29,639 INFO L471 AbstractCegarLoop]: Abstraction has 5282 states and 7204 transitions. [2025-03-03 16:21:29,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 5282 states and 7204 transitions. [2025-03-03 16:21:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:29,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:29,641 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] [2025-03-03 16:21:29,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:21:29,641 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:29,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1898372874, now seen corresponding path program 1 times [2025-03-03 16:21:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:29,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896405018] [2025-03-03 16:21:29,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:29,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:29,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:21:29,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:29,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:29,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896405018] [2025-03-03 16:21:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896405018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:29,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067845993] [2025-03-03 16:21:29,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:29,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:29,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:29,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:29,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:29,708 INFO L87 Difference]: Start difference. First operand 5282 states and 7204 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:30,465 INFO L93 Difference]: Finished difference Result 11137 states and 16547 transitions. [2025-03-03 16:21:30,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:30,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:21:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:30,493 INFO L225 Difference]: With dead ends: 11137 [2025-03-03 16:21:30,494 INFO L226 Difference]: Without dead ends: 8476 [2025-03-03 16:21:30,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:21:30,502 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 607 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:30,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1345 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:30,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8476 states. [2025-03-03 16:21:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8476 to 7957. [2025-03-03 16:21:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7957 states, 6625 states have (on average 1.4048301886792454) internal successors, (9307), 6862 states have internal predecessors, (9307), 644 states have call successors, (644), 436 states have call predecessors, (644), 686 states have return successors, (1749), 691 states have call predecessors, (1749), 643 states have call successors, (1749) [2025-03-03 16:21:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7957 states to 7957 states and 11700 transitions. [2025-03-03 16:21:31,137 INFO L78 Accepts]: Start accepts. Automaton has 7957 states and 11700 transitions. Word has length 79 [2025-03-03 16:21:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:31,137 INFO L471 AbstractCegarLoop]: Abstraction has 7957 states and 11700 transitions. [2025-03-03 16:21:31,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 7957 states and 11700 transitions. [2025-03-03 16:21:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:31,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:31,142 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] [2025-03-03 16:21:31,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:21:31,143 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:31,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1999284841, now seen corresponding path program 1 times [2025-03-03 16:21:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:31,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120771244] [2025-03-03 16:21:31,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:31,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:21:31,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:31,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:31,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:31,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:31,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120771244] [2025-03-03 16:21:31,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120771244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:31,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:31,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580348510] [2025-03-03 16:21:31,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:31,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:31,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:31,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:31,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:31,222 INFO L87 Difference]: Start difference. First operand 7957 states and 11700 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:32,240 INFO L93 Difference]: Finished difference Result 19692 states and 32057 transitions. [2025-03-03 16:21:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:32,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:21:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:32,308 INFO L225 Difference]: With dead ends: 19692 [2025-03-03 16:21:32,308 INFO L226 Difference]: Without dead ends: 14356 [2025-03-03 16:21:32,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:21:32,332 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 573 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:32,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1337 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14356 states. [2025-03-03 16:21:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14356 to 13760. [2025-03-03 16:21:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13760 states, 11462 states have (on average 1.4404990403071016) internal successors, (16511), 12153 states have internal predecessors, (16511), 964 states have call successors, (964), 628 states have call predecessors, (964), 1332 states have return successors, (5141), 1043 states have call predecessors, (5141), 963 states have call successors, (5141) [2025-03-03 16:21:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13760 states to 13760 states and 22616 transitions. [2025-03-03 16:21:33,237 INFO L78 Accepts]: Start accepts. Automaton has 13760 states and 22616 transitions. Word has length 79 [2025-03-03 16:21:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:33,238 INFO L471 AbstractCegarLoop]: Abstraction has 13760 states and 22616 transitions. [2025-03-03 16:21:33,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 13760 states and 22616 transitions. [2025-03-03 16:21:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:33,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:33,245 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] [2025-03-03 16:21:33,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:21:33,245 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:33,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2015332566, now seen corresponding path program 1 times [2025-03-03 16:21:33,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:33,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964343164] [2025-03-03 16:21:33,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:33,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:33,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:21:33,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:33,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:33,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:33,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964343164] [2025-03-03 16:21:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964343164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:33,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229444707] [2025-03-03 16:21:33,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:33,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:33,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:33,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:33,301 INFO L87 Difference]: Start difference. First operand 13760 states and 22616 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:35,564 INFO L93 Difference]: Finished difference Result 37755 states and 70807 transitions. [2025-03-03 16:21:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:21:35,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-03-03 16:21:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:35,694 INFO L225 Difference]: With dead ends: 37755 [2025-03-03 16:21:35,695 INFO L226 Difference]: Without dead ends: 26616 [2025-03-03 16:21:35,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:21:35,738 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 538 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:35,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1325 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26616 states. [2025-03-03 16:21:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26616 to 25975. [2025-03-03 16:21:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25975 states, 21307 states have (on average 1.4462383254329563) internal successors, (30815), 23392 states have internal predecessors, (30815), 1564 states have call successors, (1564), 1004 states have call predecessors, (1564), 3102 states have return successors, (18029), 1707 states have call predecessors, (18029), 1563 states have call successors, (18029) [2025-03-03 16:21:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25975 states to 25975 states and 50408 transitions. [2025-03-03 16:21:37,670 INFO L78 Accepts]: Start accepts. Automaton has 25975 states and 50408 transitions. Word has length 79 [2025-03-03 16:21:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:37,671 INFO L471 AbstractCegarLoop]: Abstraction has 25975 states and 50408 transitions. [2025-03-03 16:21:37,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:37,671 INFO L276 IsEmpty]: Start isEmpty. Operand 25975 states and 50408 transitions. [2025-03-03 16:21:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:21:37,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:37,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:21:37,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:21:37,685 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:37,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:37,686 INFO L85 PathProgramCache]: Analyzing trace with hash 349015625, now seen corresponding path program 1 times [2025-03-03 16:21:37,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:37,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132703309] [2025-03-03 16:21:37,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:37,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 16:21:37,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:21:37,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:37,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:21:37,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:37,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132703309] [2025-03-03 16:21:37,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132703309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:37,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:37,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:21:37,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683451743] [2025-03-03 16:21:37,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:37,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:21:37,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:37,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:21:37,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:21:37,727 INFO L87 Difference]: Start difference. First operand 25975 states and 50408 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:40,552 INFO L93 Difference]: Finished difference Result 62129 states and 123136 transitions. [2025-03-03 16:21:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:21:40,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 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 79 [2025-03-03 16:21:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:40,760 INFO L225 Difference]: With dead ends: 62129 [2025-03-03 16:21:40,760 INFO L226 Difference]: Without dead ends: 38776 [2025-03-03 16:21:40,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:21:40,846 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 526 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:40,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1030 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:21:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38776 states. [2025-03-03 16:21:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38776 to 36443. [2025-03-03 16:21:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36443 states, 30034 states have (on average 1.4377705267363654) internal successors, (43182), 32850 states have internal predecessors, (43182), 2249 states have call successors, (2249), 1394 states have call predecessors, (2249), 4158 states have return successors, (22747), 2327 states have call predecessors, (22747), 2248 states have call successors, (22747) [2025-03-03 16:21:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36443 states to 36443 states and 68178 transitions. [2025-03-03 16:21:44,034 INFO L78 Accepts]: Start accepts. Automaton has 36443 states and 68178 transitions. Word has length 79 [2025-03-03 16:21:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:44,035 INFO L471 AbstractCegarLoop]: Abstraction has 36443 states and 68178 transitions. [2025-03-03 16:21:44,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:21:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 36443 states and 68178 transitions. [2025-03-03 16:21:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 16:21:44,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:44,051 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, 1] [2025-03-03 16:21:44,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:21:44,052 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:44,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash 604599405, now seen corresponding path program 1 times [2025-03-03 16:21:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:44,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758354003] [2025-03-03 16:21:44,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:44,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 16:21:44,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 16:21:44,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:44,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:21:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:44,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758354003] [2025-03-03 16:21:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758354003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:44,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:44,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:21:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620483788] [2025-03-03 16:21:44,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:44,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:21:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:44,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:21:44,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:44,107 INFO L87 Difference]: Start difference. First operand 36443 states and 68178 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-03 16:21:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:46,889 INFO L93 Difference]: Finished difference Result 41624 states and 74438 transitions. [2025-03-03 16:21:46,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:21:46,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 85 [2025-03-03 16:21:46,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:47,079 INFO L225 Difference]: With dead ends: 41624 [2025-03-03 16:21:47,079 INFO L226 Difference]: Without dead ends: 38300 [2025-03-03 16:21:47,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:21:47,106 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 680 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:47,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1095 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:21:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38300 states. [2025-03-03 16:21:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38300 to 38108. [2025-03-03 16:21:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38108 states, 31316 states have (on average 1.4264273853621152) internal successors, (44670), 34163 states have internal predecessors, (44670), 2430 states have call successors, (2430), 1553 states have call predecessors, (2430), 4360 states have return successors, (23040), 2520 states have call predecessors, (23040), 2429 states have call successors, (23040) [2025-03-03 16:21:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38108 states to 38108 states and 70140 transitions. [2025-03-03 16:21:50,757 INFO L78 Accepts]: Start accepts. Automaton has 38108 states and 70140 transitions. Word has length 85 [2025-03-03 16:21:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:50,757 INFO L471 AbstractCegarLoop]: Abstraction has 38108 states and 70140 transitions. [2025-03-03 16:21:50,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-03-03 16:21:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 38108 states and 70140 transitions. [2025-03-03 16:21:50,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:21:50,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:50,779 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1] [2025-03-03 16:21:50,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:21:50,779 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:50,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2047992368, now seen corresponding path program 1 times [2025-03-03 16:21:50,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216525370] [2025-03-03 16:21:50,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:50,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:21:50,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:21:50,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:50,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:21:50,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:50,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216525370] [2025-03-03 16:21:50,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216525370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:50,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:21:50,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:21:50,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998491762] [2025-03-03 16:21:50,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:50,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:21:50,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:50,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:21:50,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:21:50,847 INFO L87 Difference]: Start difference. First operand 38108 states and 70140 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:21:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:21:53,267 INFO L93 Difference]: Finished difference Result 40970 states and 73605 transitions. [2025-03-03 16:21:53,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:21:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-03-03 16:21:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:21:53,420 INFO L225 Difference]: With dead ends: 40970 [2025-03-03 16:21:53,420 INFO L226 Difference]: Without dead ends: 37229 [2025-03-03 16:21:53,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:21:53,443 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 1153 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:21:53,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1180 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:21:53,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37229 states. [2025-03-03 16:21:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37229 to 36889. [2025-03-03 16:21:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36889 states, 30355 states have (on average 1.4324493493658377) internal successors, (43482), 33189 states have internal predecessors, (43482), 2299 states have call successors, (2299), 1436 states have call predecessors, (2299), 4233 states have return successors, (22835), 2392 states have call predecessors, (22835), 2298 states have call successors, (22835) [2025-03-03 16:21:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36889 states to 36889 states and 68616 transitions. [2025-03-03 16:21:55,902 INFO L78 Accepts]: Start accepts. Automaton has 36889 states and 68616 transitions. Word has length 95 [2025-03-03 16:21:55,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:21:55,902 INFO L471 AbstractCegarLoop]: Abstraction has 36889 states and 68616 transitions. [2025-03-03 16:21:55,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:21:55,903 INFO L276 IsEmpty]: Start isEmpty. Operand 36889 states and 68616 transitions. [2025-03-03 16:21:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 16:21:55,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:21:55,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03-03 16:21:55,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:21:55,991 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:21:55,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:21:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash -867292745, now seen corresponding path program 1 times [2025-03-03 16:21:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:21:55,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108754399] [2025-03-03 16:21:55,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:21:55,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 16:21:56,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 16:21:56,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:56,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 16:21:56,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:21:56,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108754399] [2025-03-03 16:21:56,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108754399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:21:56,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687481843] [2025-03-03 16:21:56,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:21:56,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:21:56,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:21:56,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:21:56,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:21:56,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 16:21:56,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 16:21:56,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:21:56,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:21:56,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:21:56,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:21:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 16:21:56,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:21:56,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687481843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:21:56,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:21:56,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 16:21:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961493741] [2025-03-03 16:21:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:21:56,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:21:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:21:56,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:21:56,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:21:56,157 INFO L87 Difference]: Start difference. First operand 36889 states and 68616 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)