./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7889f6823684efa4d90d392ed393927ee5c2d2eb45f6dbf47b7c030213ef334f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:33:24,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:33:24,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:33:24,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:33:24,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:33:24,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:33:24,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:33:24,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:33:24,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:33:24,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:33:24,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:33:24,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:33:24,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:33:24,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:33:24,260 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:33:24,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:33:24,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:33:24,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:33:24,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:33:24,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:33:24,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:33:24,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:33:24,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:33:24,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:33:24,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:33:24,262 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 -> 7889f6823684efa4d90d392ed393927ee5c2d2eb45f6dbf47b7c030213ef334f [2025-03-08 07:33:24,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:33:24,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:33:24,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:33:24,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:33:24,508 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:33:24,508 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.08.cil-1.c [2025-03-08 07:33:25,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4b241b2/2ab84aa5c2f449b094f91aff627bb5a3/FLAG8b5e3c2fc [2025-03-08 07:33:25,934 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:33:25,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.08.cil-1.c [2025-03-08 07:33:25,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4b241b2/2ab84aa5c2f449b094f91aff627bb5a3/FLAG8b5e3c2fc [2025-03-08 07:33:26,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e4b241b2/2ab84aa5c2f449b094f91aff627bb5a3 [2025-03-08 07:33:26,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:33:26,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:33:26,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:33:26,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:33:26,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:33:26,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be41b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26, skipping insertion in model container [2025-03-08 07:33:26,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:33:26,412 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.08.cil-1.c[914,927] [2025-03-08 07:33:26,470 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.08.cil-1.c[7115,7128] [2025-03-08 07:33:26,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:33:26,580 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:33:26,588 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.08.cil-1.c[914,927] [2025-03-08 07:33:26,603 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.08.cil-1.c[7115,7128] [2025-03-08 07:33:26,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:33:26,645 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:33:26,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26 WrapperNode [2025-03-08 07:33:26,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:33:26,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:33:26,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:33:26,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:33:26,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,683 INFO L138 Inliner]: procedures = 69, calls = 81, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 783 [2025-03-08 07:33:26,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:33:26,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:33:26,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:33:26,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:33:26,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:33:26,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,727 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:33:26,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:33:26,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:33:26,734 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:33:26,734 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (1/1) ... [2025-03-08 07:33:26,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:33:26,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:26,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:33:26,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:33:26,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:33:26,786 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:33:26,786 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:33:26,786 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:33:26,787 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:33:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:33:26,787 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:33:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:33:26,787 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:33:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:33:26,787 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:33:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:33:26,787 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:33:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:33:26,787 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:33:26,787 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:33:26,787 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:33:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:33:26,788 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:33:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:33:26,788 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:33:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:33:26,788 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:33:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:33:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:33:26,788 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:33:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:33:26,788 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:33:26,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:33:26,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:33:26,789 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:33:26,789 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:33:26,868 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:33:26,869 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:33:27,470 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-08 07:33:27,470 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:33:27,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:33:27,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:33:27,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:33:27 BoogieIcfgContainer [2025-03-08 07:33:27,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:33:27,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:33:27,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:33:27,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:33:27,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:33:26" (1/3) ... [2025-03-08 07:33:27,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a19371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:33:27, skipping insertion in model container [2025-03-08 07:33:27,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:33:26" (2/3) ... [2025-03-08 07:33:27,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75a19371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:33:27, skipping insertion in model container [2025-03-08 07:33:27,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:33:27" (3/3) ... [2025-03-08 07:33:27,501 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.08.cil-1.c [2025-03-08 07:33:27,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:33:27,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.08.cil-1.c that has 15 procedures, 377 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-08 07:33:27,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:33:27,565 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;@35ae5e4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:33:27,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:33:27,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 377 states, 326 states have (on average 1.5766871165644172) internal successors, (514), 330 states have internal predecessors, (514), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 07:33:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:27,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:27,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:27,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:27,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1155254639, now seen corresponding path program 1 times [2025-03-08 07:33:27,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:27,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367461126] [2025-03-08 07:33:27,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:27,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:27,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:27,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:27,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:27,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:27,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367461126] [2025-03-08 07:33:27,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367461126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:27,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345378629] [2025-03-08 07:33:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:27,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:27,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:27,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:27,983 INFO L87 Difference]: Start difference. First operand has 377 states, 326 states have (on average 1.5766871165644172) internal successors, (514), 330 states have internal predecessors, (514), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:33:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:28,689 INFO L93 Difference]: Finished difference Result 829 states and 1284 transitions. [2025-03-08 07:33:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:28,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:28,706 INFO L225 Difference]: With dead ends: 829 [2025-03-08 07:33:28,707 INFO L226 Difference]: Without dead ends: 466 [2025-03-08 07:33:28,713 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-08 07:33:28,714 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 396 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:28,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1196 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-08 07:33:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 459. [2025-03-08 07:33:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 388 states have (on average 1.5154639175257731) internal successors, (588), 394 states have internal predecessors, (588), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (50), 46 states have call predecessors, (50), 45 states have call successors, (50) [2025-03-08 07:33:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 685 transitions. [2025-03-08 07:33:28,788 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 685 transitions. Word has length 62 [2025-03-08 07:33:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:28,788 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 685 transitions. [2025-03-08 07:33:28,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:33:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 685 transitions. [2025-03-08 07:33:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:28,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:28,794 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] [2025-03-08 07:33:28,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:33:28,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:28,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash 530044020, now seen corresponding path program 1 times [2025-03-08 07:33:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896397028] [2025-03-08 07:33:28,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:28,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:28,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:28,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:28,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:28,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:28,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:28,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896397028] [2025-03-08 07:33:28,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896397028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:28,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:28,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:28,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810549737] [2025-03-08 07:33:28,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:28,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:28,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:28,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:28,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:28,974 INFO L87 Difference]: Start difference. First operand 459 states and 685 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-08 07:33:29,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:29,615 INFO L93 Difference]: Finished difference Result 764 states and 1104 transitions. [2025-03-08 07:33:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:29,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:29,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:29,619 INFO L225 Difference]: With dead ends: 764 [2025-03-08 07:33:29,619 INFO L226 Difference]: Without dead ends: 595 [2025-03-08 07:33:29,620 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-08 07:33:29,620 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 831 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:29,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1376 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-03-08 07:33:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 551. [2025-03-08 07:33:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 460 states have (on average 1.4956521739130435) internal successors, (688), 468 states have internal predecessors, (688), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (69), 58 states have call predecessors, (69), 56 states have call successors, (69) [2025-03-08 07:33:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 815 transitions. [2025-03-08 07:33:29,656 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 815 transitions. Word has length 62 [2025-03-08 07:33:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:29,656 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 815 transitions. [2025-03-08 07:33:29,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-08 07:33:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 815 transitions. [2025-03-08 07:33:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:29,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:29,658 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] [2025-03-08 07:33:29,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:33:29,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:29,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1499625043, now seen corresponding path program 1 times [2025-03-08 07:33:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:29,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494168767] [2025-03-08 07:33:29,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:29,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:29,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:29,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:29,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:29,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-08 07:33:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:29,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494168767] [2025-03-08 07:33:29,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494168767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:29,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:29,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:29,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131092874] [2025-03-08 07:33:29,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:29,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:29,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:29,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:29,727 INFO L87 Difference]: Start difference. First operand 551 states and 815 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:33:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:29,768 INFO L93 Difference]: Finished difference Result 811 states and 1176 transitions. [2025-03-08 07:33:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:29,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:29,772 INFO L225 Difference]: With dead ends: 811 [2025-03-08 07:33:29,772 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 07:33:29,773 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-08 07:33:29,773 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2765 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-08 07:33:29,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2765 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 07:33:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-08 07:33:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 464 states have (on average 1.4870689655172413) internal successors, (690), 472 states have internal predecessors, (690), 58 states have call successors, (58), 28 states have call predecessors, (58), 32 states have return successors, (70), 59 states have call predecessors, (70), 56 states have call successors, (70) [2025-03-08 07:33:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 818 transitions. [2025-03-08 07:33:29,818 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 818 transitions. Word has length 62 [2025-03-08 07:33:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:29,818 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 818 transitions. [2025-03-08 07:33:29,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:33:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 818 transitions. [2025-03-08 07:33:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:29,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:29,823 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] [2025-03-08 07:33:29,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:33:29,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:29,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1069861356, now seen corresponding path program 1 times [2025-03-08 07:33:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:29,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864059066] [2025-03-08 07:33:29,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:29,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:29,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:29,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:29,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864059066] [2025-03-08 07:33:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864059066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:29,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850091221] [2025-03-08 07:33:29,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:29,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:29,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:29,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:29,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:29,912 INFO L87 Difference]: Start difference. First operand 556 states and 818 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:33:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:30,453 INFO L93 Difference]: Finished difference Result 2482 states and 3502 transitions. [2025-03-08 07:33:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-03-08 07:33:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:30,465 INFO L225 Difference]: With dead ends: 2482 [2025-03-08 07:33:30,465 INFO L226 Difference]: Without dead ends: 2222 [2025-03-08 07:33:30,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:33:30,468 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 1573 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:30,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 2344 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2025-03-08 07:33:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2092. [2025-03-08 07:33:30,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1661 states have (on average 1.3732691149909693) internal successors, (2281), 1697 states have internal predecessors, (2281), 223 states have call successors, (223), 172 states have call predecessors, (223), 206 states have return successors, (339), 226 states have call predecessors, (339), 221 states have call successors, (339) [2025-03-08 07:33:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2843 transitions. [2025-03-08 07:33:30,617 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2843 transitions. Word has length 62 [2025-03-08 07:33:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:30,617 INFO L471 AbstractCegarLoop]: Abstraction has 2092 states and 2843 transitions. [2025-03-08 07:33:30,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-08 07:33:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2843 transitions. [2025-03-08 07:33:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:30,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:30,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:30,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:33:30,619 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:30,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 513402225, now seen corresponding path program 1 times [2025-03-08 07:33:30,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:30,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171845238] [2025-03-08 07:33:30,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:30,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:30,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:30,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:30,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:30,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:30,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171845238] [2025-03-08 07:33:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171845238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:30,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:30,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204776006] [2025-03-08 07:33:30,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:30,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:30,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:30,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:30,694 INFO L87 Difference]: Start difference. First operand 2092 states and 2843 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:33:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:30,790 INFO L93 Difference]: Finished difference Result 3933 states and 5334 transitions. [2025-03-08 07:33:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:30,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:30,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:30,804 INFO L225 Difference]: With dead ends: 3933 [2025-03-08 07:33:30,804 INFO L226 Difference]: Without dead ends: 2137 [2025-03-08 07:33:30,810 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-08 07:33:30,812 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2765 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-08 07:33:30,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2765 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2025-03-08 07:33:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2137. [2025-03-08 07:33:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 1697 states have (on average 1.3565114908662346) internal successors, (2302), 1733 states have internal predecessors, (2302), 223 states have call successors, (223), 172 states have call predecessors, (223), 215 states have return successors, (357), 235 states have call predecessors, (357), 221 states have call successors, (357) [2025-03-08 07:33:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2882 transitions. [2025-03-08 07:33:30,944 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2882 transitions. Word has length 62 [2025-03-08 07:33:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:30,945 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 2882 transitions. [2025-03-08 07:33:30,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 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-08 07:33:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2882 transitions. [2025-03-08 07:33:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:30,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:30,946 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] [2025-03-08 07:33:30,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:33:30,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:30,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash 544422032, now seen corresponding path program 1 times [2025-03-08 07:33:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:30,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403963170] [2025-03-08 07:33:30,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:30,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:30,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:30,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:30,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:31,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:31,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403963170] [2025-03-08 07:33:31,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403963170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:31,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:31,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:31,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209676299] [2025-03-08 07:33:31,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:31,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:31,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:31,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:31,078 INFO L87 Difference]: Start difference. First operand 2137 states and 2882 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-08 07:33:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:31,786 INFO L93 Difference]: Finished difference Result 3833 states and 5071 transitions. [2025-03-08 07:33:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:33:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:31,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:31,799 INFO L225 Difference]: With dead ends: 3833 [2025-03-08 07:33:31,800 INFO L226 Difference]: Without dead ends: 2339 [2025-03-08 07:33:31,803 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-08 07:33:31,805 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 821 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:31,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1182 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2025-03-08 07:33:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2147. [2025-03-08 07:33:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1709 states have (on average 1.3499122293739028) internal successors, (2307), 1740 states have internal predecessors, (2307), 224 states have call successors, (224), 173 states have call predecessors, (224), 212 states have return successors, (341), 237 states have call predecessors, (341), 222 states have call successors, (341) [2025-03-08 07:33:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2872 transitions. [2025-03-08 07:33:31,912 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2872 transitions. Word has length 62 [2025-03-08 07:33:31,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:31,913 INFO L471 AbstractCegarLoop]: Abstraction has 2147 states and 2872 transitions. [2025-03-08 07:33:31,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-08 07:33:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2872 transitions. [2025-03-08 07:33:31,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 07:33:31,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:31,915 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] [2025-03-08 07:33:31,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:33:31,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:31,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 755772945, now seen corresponding path program 1 times [2025-03-08 07:33:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:31,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697743249] [2025-03-08 07:33:31,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:31,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:31,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 07:33:31,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 07:33:31,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:31,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:31,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:31,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697743249] [2025-03-08 07:33:31,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697743249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:31,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:31,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:33:31,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822106122] [2025-03-08 07:33:31,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:31,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:33:31,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:31,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:33:31,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:33:31,985 INFO L87 Difference]: Start difference. First operand 2147 states and 2872 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-08 07:33:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:32,451 INFO L93 Difference]: Finished difference Result 5776 states and 7646 transitions. [2025-03-08 07:33:32,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:33:32,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 62 [2025-03-08 07:33:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:32,470 INFO L225 Difference]: With dead ends: 5776 [2025-03-08 07:33:32,470 INFO L226 Difference]: Without dead ends: 3928 [2025-03-08 07:33:32,476 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-08 07:33:32,477 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 777 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:32,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 601 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:33:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2025-03-08 07:33:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3924. [2025-03-08 07:33:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3073 states have (on average 1.302635860722421) internal successors, (4003), 3134 states have internal predecessors, (4003), 426 states have call successors, (426), 339 states have call predecessors, (426), 423 states have return successors, (719), 457 states have call predecessors, (719), 424 states have call successors, (719) [2025-03-08 07:33:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5148 transitions. [2025-03-08 07:33:32,710 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5148 transitions. Word has length 62 [2025-03-08 07:33:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:32,710 INFO L471 AbstractCegarLoop]: Abstraction has 3924 states and 5148 transitions. [2025-03-08 07:33:32,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-08 07:33:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5148 transitions. [2025-03-08 07:33:32,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:33:32,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:32,713 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] [2025-03-08 07:33:32,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:33:32,713 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:32,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:32,714 INFO L85 PathProgramCache]: Analyzing trace with hash 141894521, now seen corresponding path program 1 times [2025-03-08 07:33:32,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:32,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232947263] [2025-03-08 07:33:32,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:32,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:32,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:33:32,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:33:32,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:32,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:32,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:32,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232947263] [2025-03-08 07:33:32,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232947263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:32,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:32,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:32,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109108833] [2025-03-08 07:33:32,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:32,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:32,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:32,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:32,752 INFO L87 Difference]: Start difference. First operand 3924 states and 5148 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:33:32,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:32,980 INFO L93 Difference]: Finished difference Result 9901 states and 13014 transitions. [2025-03-08 07:33:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 63 [2025-03-08 07:33:32,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:33,006 INFO L225 Difference]: With dead ends: 9901 [2025-03-08 07:33:33,006 INFO L226 Difference]: Without dead ends: 6255 [2025-03-08 07:33:33,015 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-08 07:33:33,015 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 102 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1090 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-08 07:33:33,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1090 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-03-08 07:33:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6121. [2025-03-08 07:33:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 4732 states have (on average 1.2880388841927304) internal successors, (6095), 4810 states have internal predecessors, (6095), 687 states have call successors, (687), 571 states have call predecessors, (687), 700 states have return successors, (1173), 746 states have call predecessors, (1173), 685 states have call successors, (1173) [2025-03-08 07:33:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 7955 transitions. [2025-03-08 07:33:33,379 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 7955 transitions. Word has length 63 [2025-03-08 07:33:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:33,380 INFO L471 AbstractCegarLoop]: Abstraction has 6121 states and 7955 transitions. [2025-03-08 07:33:33,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:33:33,380 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 7955 transitions. [2025-03-08 07:33:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:33:33,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:33,382 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] [2025-03-08 07:33:33,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:33:33,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:33,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:33,383 INFO L85 PathProgramCache]: Analyzing trace with hash 999850663, now seen corresponding path program 1 times [2025-03-08 07:33:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:33,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947071382] [2025-03-08 07:33:33,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:33,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:33,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:33:33,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:33:33,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:33,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:33,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:33,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947071382] [2025-03-08 07:33:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947071382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:33,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:33,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:33:33,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329084852] [2025-03-08 07:33:33,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:33,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:33:33,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:33,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:33:33,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:33:33,492 INFO L87 Difference]: Start difference. First operand 6121 states and 7955 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 07:33:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:33,996 INFO L93 Difference]: Finished difference Result 7239 states and 9334 transitions. [2025-03-08 07:33:33,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:33:33,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 68 [2025-03-08 07:33:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:34,029 INFO L225 Difference]: With dead ends: 7239 [2025-03-08 07:33:34,029 INFO L226 Difference]: Without dead ends: 7236 [2025-03-08 07:33:34,034 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-08 07:33:34,034 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1037 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:34,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 653 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:33:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2025-03-08 07:33:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 7137. [2025-03-08 07:33:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7137 states, 5497 states have (on average 1.2783336365290159) internal successors, (7027), 5584 states have internal predecessors, (7027), 813 states have call successors, (813), 685 states have call predecessors, (813), 825 states have return successors, (1366), 874 states have call predecessors, (1366), 812 states have call successors, (1366) [2025-03-08 07:33:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 9206 transitions. [2025-03-08 07:33:34,566 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 9206 transitions. Word has length 68 [2025-03-08 07:33:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:34,566 INFO L471 AbstractCegarLoop]: Abstraction has 7137 states and 9206 transitions. [2025-03-08 07:33:34,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-08 07:33:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 9206 transitions. [2025-03-08 07:33:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 07:33:34,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:34,569 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] [2025-03-08 07:33:34,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:33:34,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:34,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:34,569 INFO L85 PathProgramCache]: Analyzing trace with hash 930131061, now seen corresponding path program 1 times [2025-03-08 07:33:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:34,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56017160] [2025-03-08 07:33:34,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:34,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:34,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:33:34,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:33:34,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:34,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56017160] [2025-03-08 07:33:34,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56017160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:34,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058644749] [2025-03-08 07:33:34,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:34,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:34,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:34,651 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-08 07:33:34,653 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-08 07:33:34,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 07:33:34,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 07:33:34,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:34,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:34,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 07:33:34,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:34,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:33:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:35,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058644749] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:33:35,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:33:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-08 07:33:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813041916] [2025-03-08 07:33:35,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:33:35,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:33:35,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:35,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:33:35,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:35,041 INFO L87 Difference]: Start difference. First operand 7137 states and 9206 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-08 07:33:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:35,826 INFO L93 Difference]: Finished difference Result 15013 states and 19179 transitions. [2025-03-08 07:33:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 07:33:35,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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 69 [2025-03-08 07:33:35,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:35,889 INFO L225 Difference]: With dead ends: 15013 [2025-03-08 07:33:35,890 INFO L226 Difference]: Without dead ends: 15010 [2025-03-08 07:33:35,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 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-08 07:33:35,901 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 920 mSDsluCounter, 1943 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:35,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 2681 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:33:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15010 states. [2025-03-08 07:33:36,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15010 to 13700. [2025-03-08 07:33:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13700 states, 10536 states have (on average 1.2706909643128321) internal successors, (13388), 10703 states have internal predecessors, (13388), 1545 states have call successors, (1545), 1319 states have call predecessors, (1545), 1617 states have return successors, (2633), 1684 states have call predecessors, (2633), 1544 states have call successors, (2633) [2025-03-08 07:33:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13700 states to 13700 states and 17566 transitions. [2025-03-08 07:33:36,815 INFO L78 Accepts]: Start accepts. Automaton has 13700 states and 17566 transitions. Word has length 69 [2025-03-08 07:33:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:36,815 INFO L471 AbstractCegarLoop]: Abstraction has 13700 states and 17566 transitions. [2025-03-08 07:33:36,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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-08 07:33:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 13700 states and 17566 transitions. [2025-03-08 07:33:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 07:33:36,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:36,818 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:33:36,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:33:37,022 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,SelfDestructingSolverStorable9 [2025-03-08 07:33:37,022 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:37,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 354040600, now seen corresponding path program 2 times [2025-03-08 07:33:37,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:37,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079414365] [2025-03-08 07:33:37,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 07:33:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:37,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-03-08 07:33:37,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 07:33:37,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 07:33:37,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079414365] [2025-03-08 07:33:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079414365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211164639] [2025-03-08 07:33:37,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:37,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:37,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:37,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:37,061 INFO L87 Difference]: Start difference. First operand 13700 states and 17566 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-08 07:33:37,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:37,594 INFO L93 Difference]: Finished difference Result 20426 states and 26255 transitions. [2025-03-08 07:33:37,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:37,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 71 [2025-03-08 07:33:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:37,633 INFO L225 Difference]: With dead ends: 20426 [2025-03-08 07:33:37,633 INFO L226 Difference]: Without dead ends: 7850 [2025-03-08 07:33:37,665 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-08 07:33:37,665 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 526 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 743 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-08 07:33:37,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 743 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7850 states. [2025-03-08 07:33:38,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7850 to 7752. [2025-03-08 07:33:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7752 states, 5989 states have (on average 1.2484555017532142) internal successors, (7477), 6070 states have internal predecessors, (7477), 879 states have call successors, (879), 741 states have call predecessors, (879), 882 states have return successors, (1379), 947 states have call predecessors, (1379), 878 states have call successors, (1379) [2025-03-08 07:33:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7752 states to 7752 states and 9735 transitions. [2025-03-08 07:33:38,102 INFO L78 Accepts]: Start accepts. Automaton has 7752 states and 9735 transitions. Word has length 71 [2025-03-08 07:33:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:38,102 INFO L471 AbstractCegarLoop]: Abstraction has 7752 states and 9735 transitions. [2025-03-08 07:33:38,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-08 07:33:38,103 INFO L276 IsEmpty]: Start isEmpty. Operand 7752 states and 9735 transitions. [2025-03-08 07:33:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:33:38,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:38,106 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:33:38,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:33:38,106 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:38,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:38,107 INFO L85 PathProgramCache]: Analyzing trace with hash -742540112, now seen corresponding path program 1 times [2025-03-08 07:33:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:38,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150783237] [2025-03-08 07:33:38,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:38,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:33:38,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:33:38,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:38,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 07:33:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:38,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150783237] [2025-03-08 07:33:38,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150783237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:38,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:38,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:38,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712066519] [2025-03-08 07:33:38,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:38,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:38,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:38,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:38,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:38,187 INFO L87 Difference]: Start difference. First operand 7752 states and 9735 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-08 07:33:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:39,471 INFO L93 Difference]: Finished difference Result 22754 states and 28538 transitions. [2025-03-08 07:33:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 07:33:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 80 [2025-03-08 07:33:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:39,521 INFO L225 Difference]: With dead ends: 22754 [2025-03-08 07:33:39,522 INFO L226 Difference]: Without dead ends: 15304 [2025-03-08 07:33:39,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:33:39,541 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 678 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:39,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1586 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:33:39,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15304 states. [2025-03-08 07:33:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15304 to 14661. [2025-03-08 07:33:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14661 states, 11207 states have (on average 1.2162933880610334) internal successors, (13631), 11396 states have internal predecessors, (13631), 1698 states have call successors, (1698), 1441 states have call predecessors, (1698), 1754 states have return successors, (2892), 1836 states have call predecessors, (2892), 1697 states have call successors, (2892) [2025-03-08 07:33:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14661 states to 14661 states and 18221 transitions. [2025-03-08 07:33:40,235 INFO L78 Accepts]: Start accepts. Automaton has 14661 states and 18221 transitions. Word has length 80 [2025-03-08 07:33:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:40,236 INFO L471 AbstractCegarLoop]: Abstraction has 14661 states and 18221 transitions. [2025-03-08 07:33:40,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-08 07:33:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 14661 states and 18221 transitions. [2025-03-08 07:33:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:33:40,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:40,241 INFO L218 NwaCegarLoop]: trace histogram [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-08 07:33:40,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:33:40,242 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:40,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1333939009, now seen corresponding path program 1 times [2025-03-08 07:33:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:40,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252171536] [2025-03-08 07:33:40,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:40,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:40,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:33:40,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:33:40,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:40,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 07:33:40,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:40,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252171536] [2025-03-08 07:33:40,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252171536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:40,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:40,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:33:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440972311] [2025-03-08 07:33:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:40,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:33:40,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:40,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:33:40,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:33:40,325 INFO L87 Difference]: Start difference. First operand 14661 states and 18221 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-08 07:33:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:42,171 INFO L93 Difference]: Finished difference Result 26235 states and 32548 transitions. [2025-03-08 07:33:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:33:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 86 [2025-03-08 07:33:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:42,217 INFO L225 Difference]: With dead ends: 26235 [2025-03-08 07:33:42,218 INFO L226 Difference]: Without dead ends: 12485 [2025-03-08 07:33:42,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:33:42,250 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1409 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:42,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 1660 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:33:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12485 states. [2025-03-08 07:33:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12485 to 11757. [2025-03-08 07:33:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11757 states, 9041 states have (on average 1.208605242782878) internal successors, (10927), 9184 states have internal predecessors, (10927), 1327 states have call successors, (1327), 1122 states have call predecessors, (1327), 1387 states have return successors, (2084), 1460 states have call predecessors, (2084), 1326 states have call successors, (2084) [2025-03-08 07:33:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 14338 transitions. [2025-03-08 07:33:42,938 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 14338 transitions. Word has length 86 [2025-03-08 07:33:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:42,938 INFO L471 AbstractCegarLoop]: Abstraction has 11757 states and 14338 transitions. [2025-03-08 07:33:42,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-08 07:33:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 14338 transitions. [2025-03-08 07:33:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 07:33:42,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:42,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2025-03-08 07:33:42,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:33:42,948 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:42,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:42,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1539751391, now seen corresponding path program 1 times [2025-03-08 07:33:42,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:42,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739869379] [2025-03-08 07:33:42,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:42,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:42,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:33:42,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:33:42,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:42,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-08 07:33:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739869379] [2025-03-08 07:33:43,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739869379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:33:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807742697] [2025-03-08 07:33:43,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:43,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:33:43,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:33:43,043 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-08 07:33:43,045 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-08 07:33:43,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 07:33:43,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 07:33:43,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:43,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:43,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 07:33:43,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:33:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:33:43,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:33:43,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807742697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:43,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:33:43,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-03-08 07:33:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592835689] [2025-03-08 07:33:43,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:43,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:43,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:43,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 07:33:43,183 INFO L87 Difference]: Start difference. First operand 11757 states and 14338 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:33:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:43,406 INFO L93 Difference]: Finished difference Result 16836 states and 20468 transitions. [2025-03-08 07:33:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:43,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-03-08 07:33:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:43,432 INFO L225 Difference]: With dead ends: 16836 [2025-03-08 07:33:43,432 INFO L226 Difference]: Without dead ends: 5389 [2025-03-08 07:33:43,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 07:33:43,450 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 0 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2751 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:43,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2751 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5389 states. [2025-03-08 07:33:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5389 to 5201. [2025-03-08 07:33:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 4097 states have (on average 1.2077129607029533) internal successors, (4948), 4141 states have internal predecessors, (4948), 537 states have call successors, (537), 433 states have call predecessors, (537), 565 states have return successors, (833), 627 states have call predecessors, (833), 536 states have call successors, (833) [2025-03-08 07:33:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 6318 transitions. [2025-03-08 07:33:43,669 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 6318 transitions. Word has length 139 [2025-03-08 07:33:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 6318 transitions. [2025-03-08 07:33:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:33:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 6318 transitions. [2025-03-08 07:33:43,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 07:33:43,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:43,675 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-08 07:33:43,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:33:43,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 07:33:43,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:43,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash -850498861, now seen corresponding path program 1 times [2025-03-08 07:33:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:43,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731096262] [2025-03-08 07:33:43,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:43,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:43,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 07:33:43,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 07:33:43,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:43,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 07:33:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731096262] [2025-03-08 07:33:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731096262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:43,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:43,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:33:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476571442] [2025-03-08 07:33:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:33:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:43,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:33:43,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:33:43,916 INFO L87 Difference]: Start difference. First operand 5201 states and 6318 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 07:33:44,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:44,075 INFO L93 Difference]: Finished difference Result 5514 states and 6684 transitions. [2025-03-08 07:33:44,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:33:44,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 141 [2025-03-08 07:33:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:44,097 INFO L225 Difference]: With dead ends: 5514 [2025-03-08 07:33:44,097 INFO L226 Difference]: Without dead ends: 4793 [2025-03-08 07:33:44,100 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-08 07:33:44,101 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 120 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 982 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-08 07:33:44,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 982 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:33:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2025-03-08 07:33:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 4793. [2025-03-08 07:33:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4793 states, 3785 states have (on average 1.2113606340819023) internal successors, (4585), 3826 states have internal predecessors, (4585), 491 states have call successors, (491), 393 states have call predecessors, (491), 515 states have return successors, (770), 574 states have call predecessors, (770), 490 states have call successors, (770) [2025-03-08 07:33:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4793 states to 4793 states and 5846 transitions. [2025-03-08 07:33:44,360 INFO L78 Accepts]: Start accepts. Automaton has 4793 states and 5846 transitions. Word has length 141 [2025-03-08 07:33:44,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:44,360 INFO L471 AbstractCegarLoop]: Abstraction has 4793 states and 5846 transitions. [2025-03-08 07:33:44,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-08 07:33:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4793 states and 5846 transitions. [2025-03-08 07:33:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:33:44,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:44,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:44,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:33:44,366 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:44,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash -394998956, now seen corresponding path program 1 times [2025-03-08 07:33:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:44,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906063975] [2025-03-08 07:33:44,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:44,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:33:44,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:33:44,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:44,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:44,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906063975] [2025-03-08 07:33:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906063975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:44,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:44,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:33:44,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533156621] [2025-03-08 07:33:44,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:44,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:33:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:44,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:33:44,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:33:44,438 INFO L87 Difference]: Start difference. First operand 4793 states and 5846 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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-08 07:33:45,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:45,027 INFO L93 Difference]: Finished difference Result 5343 states and 6716 transitions. [2025-03-08 07:33:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:33:45,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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 132 [2025-03-08 07:33:45,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:45,044 INFO L225 Difference]: With dead ends: 5343 [2025-03-08 07:33:45,044 INFO L226 Difference]: Without dead ends: 5084 [2025-03-08 07:33:45,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:45,047 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 971 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:45,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1328 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2025-03-08 07:33:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 5063. [2025-03-08 07:33:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 4031 states have (on average 1.2341850657405111) internal successors, (4975), 4073 states have internal predecessors, (4975), 508 states have call successors, (508), 399 states have call predecessors, (508), 522 states have return successors, (788), 591 states have call predecessors, (788), 507 states have call successors, (788) [2025-03-08 07:33:45,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 6271 transitions. [2025-03-08 07:33:45,273 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 6271 transitions. Word has length 132 [2025-03-08 07:33:45,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:45,274 INFO L471 AbstractCegarLoop]: Abstraction has 5063 states and 6271 transitions. [2025-03-08 07:33:45,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 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-08 07:33:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 6271 transitions. [2025-03-08 07:33:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:33:45,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:45,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:45,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:33:45,279 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:45,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash 46570774, now seen corresponding path program 1 times [2025-03-08 07:33:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:45,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727959938] [2025-03-08 07:33:45,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:45,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:33:45,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:33:45,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:45,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:45,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:45,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727959938] [2025-03-08 07:33:45,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727959938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:45,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:45,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:45,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220958188] [2025-03-08 07:33:45,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:45,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:45,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:45,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:45,362 INFO L87 Difference]: Start difference. First operand 5063 states and 6271 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:46,137 INFO L93 Difference]: Finished difference Result 5936 states and 7663 transitions. [2025-03-08 07:33:46,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:33:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:46,154 INFO L225 Difference]: With dead ends: 5936 [2025-03-08 07:33:46,154 INFO L226 Difference]: Without dead ends: 5407 [2025-03-08 07:33:46,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:33:46,156 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 973 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:46,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 2445 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2025-03-08 07:33:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 5314. [2025-03-08 07:33:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5314 states, 4258 states have (on average 1.2510568341944575) internal successors, (5327), 4301 states have internal predecessors, (5327), 525 states have call successors, (525), 405 states have call predecessors, (525), 529 states have return successors, (808), 609 states have call predecessors, (808), 524 states have call successors, (808) [2025-03-08 07:33:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5314 states to 5314 states and 6660 transitions. [2025-03-08 07:33:46,455 INFO L78 Accepts]: Start accepts. Automaton has 5314 states and 6660 transitions. Word has length 132 [2025-03-08 07:33:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:46,456 INFO L471 AbstractCegarLoop]: Abstraction has 5314 states and 6660 transitions. [2025-03-08 07:33:46,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 5314 states and 6660 transitions. [2025-03-08 07:33:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:33:46,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:46,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:46,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:33:46,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 282248949, now seen corresponding path program 1 times [2025-03-08 07:33:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:46,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870250529] [2025-03-08 07:33:46,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:46,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:46,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:33:46,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:33:46,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:46,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:46,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:46,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870250529] [2025-03-08 07:33:46,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870250529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:46,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:46,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:46,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831860922] [2025-03-08 07:33:46,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:46,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:46,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:46,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:46,550 INFO L87 Difference]: Start difference. First operand 5314 states and 6660 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:47,356 INFO L93 Difference]: Finished difference Result 6735 states and 8921 transitions. [2025-03-08 07:33:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:47,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:33:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:47,378 INFO L225 Difference]: With dead ends: 6735 [2025-03-08 07:33:47,378 INFO L226 Difference]: Without dead ends: 5955 [2025-03-08 07:33:47,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:33:47,382 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 968 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:47,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 2429 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5955 states. [2025-03-08 07:33:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5955 to 5849. [2025-03-08 07:33:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5849 states, 4743 states have (on average 1.2839974699557242) internal successors, (6090), 4790 states have internal predecessors, (6090), 559 states have call successors, (559), 417 states have call predecessors, (559), 545 states have return successors, (854), 645 states have call predecessors, (854), 558 states have call successors, (854) [2025-03-08 07:33:47,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5849 states to 5849 states and 7503 transitions. [2025-03-08 07:33:47,676 INFO L78 Accepts]: Start accepts. Automaton has 5849 states and 7503 transitions. Word has length 132 [2025-03-08 07:33:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:47,676 INFO L471 AbstractCegarLoop]: Abstraction has 5849 states and 7503 transitions. [2025-03-08 07:33:47,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 5849 states and 7503 transitions. [2025-03-08 07:33:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:33:47,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:47,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:47,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:33:47,683 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:47,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:47,683 INFO L85 PathProgramCache]: Analyzing trace with hash -541432522, now seen corresponding path program 1 times [2025-03-08 07:33:47,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:47,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749609971] [2025-03-08 07:33:47,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:47,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:47,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:33:47,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:33:47,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:47,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749609971] [2025-03-08 07:33:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749609971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:47,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:47,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482104677] [2025-03-08 07:33:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:47,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:47,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:47,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:47,822 INFO L87 Difference]: Start difference. First operand 5849 states and 7503 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:48,652 INFO L93 Difference]: Finished difference Result 8460 states and 11694 transitions. [2025-03-08 07:33:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:48,652 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:33:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:48,676 INFO L225 Difference]: With dead ends: 8460 [2025-03-08 07:33:48,676 INFO L226 Difference]: Without dead ends: 7145 [2025-03-08 07:33:48,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:33:48,682 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 963 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:48,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 2417 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7145 states. [2025-03-08 07:33:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7145 to 7012. [2025-03-08 07:33:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7012 states, 5800 states have (on average 1.3417241379310345) internal successors, (7782), 5861 states have internal predecessors, (7782), 627 states have call successors, (627), 441 states have call predecessors, (627), 583 states have return successors, (970), 717 states have call predecessors, (970), 626 states have call successors, (970) [2025-03-08 07:33:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7012 states to 7012 states and 9379 transitions. [2025-03-08 07:33:49,018 INFO L78 Accepts]: Start accepts. Automaton has 7012 states and 9379 transitions. Word has length 132 [2025-03-08 07:33:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:49,018 INFO L471 AbstractCegarLoop]: Abstraction has 7012 states and 9379 transitions. [2025-03-08 07:33:49,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 7012 states and 9379 transitions. [2025-03-08 07:33:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:33:49,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:49,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:49,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:33:49,025 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:49,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash 540375765, now seen corresponding path program 1 times [2025-03-08 07:33:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:49,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550337153] [2025-03-08 07:33:49,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:49,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:33:49,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:33:49,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:49,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:49,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:49,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550337153] [2025-03-08 07:33:49,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550337153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:49,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:49,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:49,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149085049] [2025-03-08 07:33:49,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:49,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:49,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:49,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:49,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:49,115 INFO L87 Difference]: Start difference. First operand 7012 states and 9379 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:50,353 INFO L93 Difference]: Finished difference Result 12263 states and 17988 transitions. [2025-03-08 07:33:50,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:50,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:33:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:50,386 INFO L225 Difference]: With dead ends: 12263 [2025-03-08 07:33:50,386 INFO L226 Difference]: Without dead ends: 9785 [2025-03-08 07:33:50,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:33:50,396 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 958 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:50,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 2405 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:33:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9785 states. [2025-03-08 07:33:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9785 to 9599. [2025-03-08 07:33:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9599 states, 8157 states have (on average 1.4257692779208042) internal successors, (11630), 8264 states have internal predecessors, (11630), 763 states have call successors, (763), 489 states have call predecessors, (763), 677 states have return successors, (1298), 861 states have call predecessors, (1298), 762 states have call successors, (1298) [2025-03-08 07:33:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9599 states to 9599 states and 13691 transitions. [2025-03-08 07:33:50,827 INFO L78 Accepts]: Start accepts. Automaton has 9599 states and 13691 transitions. Word has length 132 [2025-03-08 07:33:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:50,827 INFO L471 AbstractCegarLoop]: Abstraction has 9599 states and 13691 transitions. [2025-03-08 07:33:50,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:50,827 INFO L276 IsEmpty]: Start isEmpty. Operand 9599 states and 13691 transitions. [2025-03-08 07:33:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:33:50,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:50,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:50,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:33:50,834 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:50,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash 21083478, now seen corresponding path program 1 times [2025-03-08 07:33:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:50,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725661888] [2025-03-08 07:33:50,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:50,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:33:50,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:33:50,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:50,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:50,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-08 07:33:50,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:50,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725661888] [2025-03-08 07:33:50,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725661888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:50,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:50,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928889337] [2025-03-08 07:33:50,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:50,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:50,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:50,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:50,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:50,921 INFO L87 Difference]: Start difference. First operand 9599 states and 13691 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:51,961 INFO L93 Difference]: Finished difference Result 20854 states and 32798 transitions. [2025-03-08 07:33:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:51,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:33:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:52,008 INFO L225 Difference]: With dead ends: 20854 [2025-03-08 07:33:52,008 INFO L226 Difference]: Without dead ends: 15789 [2025-03-08 07:33:52,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:33:52,024 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 953 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:52,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 2393 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15789 states. [2025-03-08 07:33:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15789 to 15502. [2025-03-08 07:33:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15502 states, 13546 states have (on average 1.5217776465377233) internal successors, (20614), 13799 states have internal predecessors, (20614), 1035 states have call successors, (1035), 585 states have call predecessors, (1035), 919 states have return successors, (2338), 1149 states have call predecessors, (2338), 1034 states have call successors, (2338) [2025-03-08 07:33:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15502 states to 15502 states and 23987 transitions. [2025-03-08 07:33:52,703 INFO L78 Accepts]: Start accepts. Automaton has 15502 states and 23987 transitions. Word has length 132 [2025-03-08 07:33:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:52,703 INFO L471 AbstractCegarLoop]: Abstraction has 15502 states and 23987 transitions. [2025-03-08 07:33:52,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:52,704 INFO L276 IsEmpty]: Start isEmpty. Operand 15502 states and 23987 transitions. [2025-03-08 07:33:52,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:33:52,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:52,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:52,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:33:52,712 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:52,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:52,712 INFO L85 PathProgramCache]: Analyzing trace with hash -965499211, now seen corresponding path program 1 times [2025-03-08 07:33:52,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:52,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868853794] [2025-03-08 07:33:52,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:52,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:52,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:33:52,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:33:52,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:52,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:52,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:52,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868853794] [2025-03-08 07:33:52,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868853794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:52,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:52,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:52,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782759099] [2025-03-08 07:33:52,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:52,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:52,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:52,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:52,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:52,782 INFO L87 Difference]: Start difference. First operand 15502 states and 23987 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:54,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:54,042 INFO L93 Difference]: Finished difference Result 40777 states and 69148 transitions. [2025-03-08 07:33:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:54,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:33:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:54,140 INFO L225 Difference]: With dead ends: 40777 [2025-03-08 07:33:54,140 INFO L226 Difference]: Without dead ends: 29809 [2025-03-08 07:33:54,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:33:54,178 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 948 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:54,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 2381 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:33:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29809 states. [2025-03-08 07:33:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29809 to 29333. [2025-03-08 07:33:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29333 states, 26187 states have (on average 1.6088135334326192) internal successors, (42130), 26894 states have internal predecessors, (42130), 1579 states have call successors, (1579), 777 states have call predecessors, (1579), 1565 states have return successors, (5954), 1725 states have call predecessors, (5954), 1578 states have call successors, (5954) [2025-03-08 07:33:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29333 states to 29333 states and 49663 transitions. [2025-03-08 07:33:55,333 INFO L78 Accepts]: Start accepts. Automaton has 29333 states and 49663 transitions. Word has length 132 [2025-03-08 07:33:55,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:33:55,333 INFO L471 AbstractCegarLoop]: Abstraction has 29333 states and 49663 transitions. [2025-03-08 07:33:55,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 29333 states and 49663 transitions. [2025-03-08 07:33:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:33:55,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:33:55,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:33:55,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:33:55,345 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:33:55,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:33:55,345 INFO L85 PathProgramCache]: Analyzing trace with hash 111054198, now seen corresponding path program 1 times [2025-03-08 07:33:55,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:33:55,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505169775] [2025-03-08 07:33:55,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:33:55,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:33:55,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:33:55,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:33:55,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:33:55,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:33:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:33:55,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:33:55,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505169775] [2025-03-08 07:33:55,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505169775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:33:55,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:33:55,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:33:55,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584267728] [2025-03-08 07:33:55,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:33:55,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:33:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:33:55,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:33:55,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:33:55,429 INFO L87 Difference]: Start difference. First operand 29333 states and 49663 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:33:57,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:33:57,704 INFO L93 Difference]: Finished difference Result 88208 states and 162706 transitions. [2025-03-08 07:33:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:33:57,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:33:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:33:57,956 INFO L225 Difference]: With dead ends: 88208 [2025-03-08 07:33:57,957 INFO L226 Difference]: Without dead ends: 63409 [2025-03-08 07:33:58,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:33:58,042 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 943 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:33:58,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 2369 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:33:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63409 states. [2025-03-08 07:34:01,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63409 to 62584. [2025-03-08 07:34:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62584 states, 56572 states have (on average 1.6766244785406208) internal successors, (94850), 58673 states have internal predecessors, (94850), 2667 states have call successors, (2667), 1161 states have call predecessors, (2667), 3343 states have return successors, (19330), 2877 states have call predecessors, (19330), 2666 states have call successors, (19330) [2025-03-08 07:34:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62584 states to 62584 states and 116847 transitions. [2025-03-08 07:34:01,577 INFO L78 Accepts]: Start accepts. Automaton has 62584 states and 116847 transitions. Word has length 132 [2025-03-08 07:34:01,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:01,577 INFO L471 AbstractCegarLoop]: Abstraction has 62584 states and 116847 transitions. [2025-03-08 07:34:01,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:34:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 62584 states and 116847 transitions. [2025-03-08 07:34:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:34:01,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:01,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:01,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:34:01,595 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:01,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1946897045, now seen corresponding path program 1 times [2025-03-08 07:34:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904187646] [2025-03-08 07:34:01,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:01,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:34:01,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:34:01,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:01,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:01,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:01,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:01,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904187646] [2025-03-08 07:34:01,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904187646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:01,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:01,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709722954] [2025-03-08 07:34:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:01,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:01,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:01,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:01,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:01,668 INFO L87 Difference]: Start difference. First operand 62584 states and 116847 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:34:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:34:07,510 INFO L93 Difference]: Finished difference Result 203907 states and 416288 transitions. [2025-03-08 07:34:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:34:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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 132 [2025-03-08 07:34:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:34:08,251 INFO L225 Difference]: With dead ends: 203907 [2025-03-08 07:34:08,252 INFO L226 Difference]: Without dead ends: 145857 [2025-03-08 07:34:08,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:34:08,662 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 938 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:34:08,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 2357 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:34:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145857 states. [2025-03-08 07:34:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145857 to 144395. [2025-03-08 07:34:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144395 states, 131193 states have (on average 1.7262353936566737) internal successors, (226470), 137540 states have internal predecessors, (226470), 4843 states have call successors, (4843), 1929 states have call predecessors, (4843), 8357 states have return successors, (70658), 5181 states have call predecessors, (70658), 4842 states have call successors, (70658) [2025-03-08 07:34:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144395 states to 144395 states and 301971 transitions. [2025-03-08 07:34:16,532 INFO L78 Accepts]: Start accepts. Automaton has 144395 states and 301971 transitions. Word has length 132 [2025-03-08 07:34:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:34:16,532 INFO L471 AbstractCegarLoop]: Abstraction has 144395 states and 301971 transitions. [2025-03-08 07:34:16,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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-08 07:34:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 144395 states and 301971 transitions. [2025-03-08 07:34:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 07:34:16,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:34:16,560 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:34:16,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 07:34:16,560 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:34:16,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:34:16,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2006117782, now seen corresponding path program 1 times [2025-03-08 07:34:16,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:34:16,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123409084] [2025-03-08 07:34:16,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:34:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:34:16,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 07:34:16,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 07:34:16,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:34:16,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:34:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:34:16,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:34:16,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123409084] [2025-03-08 07:34:16,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123409084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:34:16,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:34:16,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:34:16,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808116066] [2025-03-08 07:34:16,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:34:16,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:34:16,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:34:16,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:34:16,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:34:16,627 INFO L87 Difference]: Start difference. First operand 144395 states and 301971 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 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)