./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.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 2cb37d56f61ec273f723a733aad4526e011a3841f34b26767a03fdc541dd1ee3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:22:02,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:22:02,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:22:02,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:22:02,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:22:02,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:22:02,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:22:02,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:22:02,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:22:02,519 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:22:02,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:22:02,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:22:02,521 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:22:02,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:22:02,521 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:22:02,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:22:02,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:22:02,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:22:02,522 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 -> 2cb37d56f61ec273f723a733aad4526e011a3841f34b26767a03fdc541dd1ee3 [2025-03-03 16:22:02,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:22:02,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:22:02,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:22:02,761 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:22:02,762 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:22:02,762 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.09.cil-1.c [2025-03-03 16:22:03,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03d0ff7f/4578238e0f5740f78c26ea41c06d3d5c/FLAG39a100149 [2025-03-03 16:22:04,130 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:22:04,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2025-03-03 16:22:04,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03d0ff7f/4578238e0f5740f78c26ea41c06d3d5c/FLAG39a100149 [2025-03-03 16:22:04,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03d0ff7f/4578238e0f5740f78c26ea41c06d3d5c [2025-03-03 16:22:04,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:22:04,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:22:04,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:22:04,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:22:04,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:22:04,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bacfa17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04, skipping insertion in model container [2025-03-03 16:22:04,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:22:04,303 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.09.cil-1.c[914,927] [2025-03-03 16:22:04,353 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.09.cil-1.c[7115,7128] [2025-03-03 16:22:04,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:22:04,455 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:22:04,464 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.09.cil-1.c[914,927] [2025-03-03 16:22:04,476 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.09.cil-1.c[7115,7128] [2025-03-03 16:22:04,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:22:04,530 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:22:04,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04 WrapperNode [2025-03-03 16:22:04,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:22:04,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:22:04,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:22:04,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:22:04,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,588 INFO L138 Inliner]: procedures = 71, calls = 84, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 840 [2025-03-03 16:22:04,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:22:04,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:22:04,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:22:04,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:22:04,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,610 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:22:04,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:22:04,635 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:22:04,635 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:22:04,635 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:22:04,636 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (1/1) ... [2025-03-03 16:22:04,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:22:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:04,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:22:04,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:22:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:22:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-03 16:22:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-03 16:22:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-03 16:22:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-03 16:22:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-03 16:22:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-03 16:22:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-03 16:22:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-03 16:22:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-03 16:22:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-03 16:22:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-03 16:22:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-03 16:22:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-03 16:22:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-03 16:22:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-03 16:22:04,687 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-03 16:22:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-03 16:22:04,687 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-03 16:22:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-03 16:22:04,687 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-03 16:22:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-03 16:22:04,687 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-03 16:22:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:22:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-03 16:22:04,687 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-03 16:22:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-03 16:22:04,687 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-03 16:22:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:22:04,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:22:04,688 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-03 16:22:04,688 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-03 16:22:04,791 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:22:04,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:22:05,474 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-03-03 16:22:05,474 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:22:05,493 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:22:05,493 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:22:05,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:22:05 BoogieIcfgContainer [2025-03-03 16:22:05,494 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:22:05,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:22:05,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:22:05,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:22:05,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:22:04" (1/3) ... [2025-03-03 16:22:05,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1968e5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:05, skipping insertion in model container [2025-03-03 16:22:05,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:22:04" (2/3) ... [2025-03-03 16:22:05,500 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1968e5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:22:05, skipping insertion in model container [2025-03-03 16:22:05,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:22:05" (3/3) ... [2025-03-03 16:22:05,501 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.09.cil-1.c [2025-03-03 16:22:05,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:22:05,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.09.cil-1.c that has 15 procedures, 430 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-03-03 16:22:05,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:22:05,572 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;@68b8a9ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:22:05,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:22:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 430 states, 376 states have (on average 1.547872340425532) internal successors, (582), 382 states have internal predecessors, (582), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 16:22:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:05,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:05,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:05,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:05,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash -895658786, now seen corresponding path program 1 times [2025-03-03 16:22:05,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:05,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524647967] [2025-03-03 16:22:05,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:05,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:05,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:05,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:05,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:05,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524647967] [2025-03-03 16:22:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524647967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:05,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757682413] [2025-03-03 16:22:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:05,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:05,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:05,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:05,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:05,836 INFO L87 Difference]: Start difference. First operand has 430 states, 376 states have (on average 1.547872340425532) internal successors, (582), 382 states have internal predecessors, (582), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:05,902 INFO L93 Difference]: Finished difference Result 836 states and 1271 transitions. [2025-03-03 16:22:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:05,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:22:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:05,913 INFO L225 Difference]: With dead ends: 836 [2025-03-03 16:22:05,913 INFO L226 Difference]: Without dead ends: 420 [2025-03-03 16:22:05,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:05,918 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 133 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:05,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1129 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-03 16:22:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-03 16:22:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 368 states have (on average 1.502717391304348) internal successors, (553), 372 states have internal predecessors, (553), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-03 16:22:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 625 transitions. [2025-03-03 16:22:05,977 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 625 transitions. Word has length 65 [2025-03-03 16:22:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:05,978 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 625 transitions. [2025-03-03 16:22:05,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 625 transitions. [2025-03-03 16:22:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:05,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:05,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:05,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:22:05,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:05,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:05,981 INFO L85 PathProgramCache]: Analyzing trace with hash -915996161, now seen corresponding path program 1 times [2025-03-03 16:22:05,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:05,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136635191] [2025-03-03 16:22:05,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:05,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:05,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:06,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:06,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:06,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:06,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:06,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136635191] [2025-03-03 16:22:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136635191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:06,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:06,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62477395] [2025-03-03 16:22:06,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:06,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:06,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:06,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:06,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:06,176 INFO L87 Difference]: Start difference. First operand 420 states and 625 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:06,855 INFO L93 Difference]: Finished difference Result 615 states and 897 transitions. [2025-03-03 16:22:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:06,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:22:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:06,862 INFO L225 Difference]: With dead ends: 615 [2025-03-03 16:22:06,862 INFO L226 Difference]: Without dead ends: 525 [2025-03-03 16:22:06,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:06,863 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 416 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:06,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1374 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-03 16:22:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 518. [2025-03-03 16:22:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 446 states have (on average 1.4775784753363228) internal successors, (659), 452 states have internal predecessors, (659), 48 states have call successors, (48), 21 states have call predecessors, (48), 22 states have return successors, (51), 47 states have call predecessors, (51), 46 states have call successors, (51) [2025-03-03 16:22:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 758 transitions. [2025-03-03 16:22:06,893 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 758 transitions. Word has length 65 [2025-03-03 16:22:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:06,893 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 758 transitions. [2025-03-03 16:22:06,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 758 transitions. [2025-03-03 16:22:06,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:06,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:06,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:06,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:22:06,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:06,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:06,897 INFO L85 PathProgramCache]: Analyzing trace with hash -274126789, now seen corresponding path program 1 times [2025-03-03 16:22:06,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:06,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259516192] [2025-03-03 16:22:06,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:06,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:06,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:06,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:06,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:06,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:07,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:07,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259516192] [2025-03-03 16:22:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259516192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:07,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:07,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590059726] [2025-03-03 16:22:07,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:07,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:07,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:07,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:07,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:07,042 INFO L87 Difference]: Start difference. First operand 518 states and 758 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:07,738 INFO L93 Difference]: Finished difference Result 841 states and 1194 transitions. [2025-03-03 16:22:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-03-03 16:22:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:07,743 INFO L225 Difference]: With dead ends: 841 [2025-03-03 16:22:07,744 INFO L226 Difference]: Without dead ends: 660 [2025-03-03 16:22:07,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:07,748 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 918 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:07,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1590 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-03 16:22:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 616. [2025-03-03 16:22:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 524 states have (on average 1.4580152671755726) internal successors, (764), 532 states have internal predecessors, (764), 59 states have call successors, (59), 28 states have call predecessors, (59), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2025-03-03 16:22:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 893 transitions. [2025-03-03 16:22:07,800 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 893 transitions. Word has length 65 [2025-03-03 16:22:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:07,800 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 893 transitions. [2025-03-03 16:22:07,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 893 transitions. [2025-03-03 16:22:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:07,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:07,802 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:07,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:22:07,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:07,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 859063804, now seen corresponding path program 1 times [2025-03-03 16:22:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641250831] [2025-03-03 16:22:07,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:07,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:07,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:07,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:07,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:07,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:07,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:07,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641250831] [2025-03-03 16:22:07,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641250831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:07,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:07,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578796583] [2025-03-03 16:22:07,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:07,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:07,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:07,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:07,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:07,863 INFO L87 Difference]: Start difference. First operand 616 states and 893 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:07,917 INFO L93 Difference]: Finished difference Result 894 states and 1272 transitions. [2025-03-03 16:22:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:07,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-03 16:22:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:07,921 INFO L225 Difference]: With dead ends: 894 [2025-03-03 16:22:07,921 INFO L226 Difference]: Without dead ends: 621 [2025-03-03 16:22:07,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:07,923 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 0 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:07,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3105 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-03 16:22:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2025-03-03 16:22:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 528 states have (on average 1.4507575757575757) internal successors, (766), 536 states have internal predecessors, (766), 59 states have call successors, (59), 28 states have call predecessors, (59), 32 states have return successors, (71), 60 states have call predecessors, (71), 57 states have call successors, (71) [2025-03-03 16:22:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 896 transitions. [2025-03-03 16:22:07,959 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 896 transitions. Word has length 65 [2025-03-03 16:22:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:07,959 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 896 transitions. [2025-03-03 16:22:07,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 896 transitions. [2025-03-03 16:22:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:22:07,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:07,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:07,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:22:07,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:07,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1803099493, now seen corresponding path program 1 times [2025-03-03 16:22:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:07,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152454652] [2025-03-03 16:22:07,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:07,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:22:07,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:22:07,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:07,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152454652] [2025-03-03 16:22:08,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152454652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:08,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:08,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:22:08,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641481922] [2025-03-03 16:22:08,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:08,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:22:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:08,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:22:08,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:22:08,067 INFO L87 Difference]: Start difference. First operand 621 states and 896 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:22:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:09,141 INFO L93 Difference]: Finished difference Result 1889 states and 2617 transitions. [2025-03-03 16:22:09,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:22:09,142 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-03-03 16:22:09,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:09,148 INFO L225 Difference]: With dead ends: 1889 [2025-03-03 16:22:09,148 INFO L226 Difference]: Without dead ends: 1593 [2025-03-03 16:22:09,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-03 16:22:09,149 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 2752 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2766 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:09,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2766 Valid, 1766 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 16:22:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2025-03-03 16:22:09,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1539. [2025-03-03 16:22:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1260 states have (on average 1.3682539682539683) internal successors, (1724), 1283 states have internal predecessors, (1724), 147 states have call successors, (147), 111 states have call predecessors, (147), 130 states have return successors, (185), 147 states have call predecessors, (185), 145 states have call successors, (185) [2025-03-03 16:22:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2056 transitions. [2025-03-03 16:22:09,213 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2056 transitions. Word has length 65 [2025-03-03 16:22:09,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:09,213 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2056 transitions. [2025-03-03 16:22:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 16:22:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2056 transitions. [2025-03-03 16:22:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:22:09,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:09,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:09,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:22:09,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:09,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1554777635, now seen corresponding path program 1 times [2025-03-03 16:22:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:09,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320027732] [2025-03-03 16:22:09,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:09,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:09,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:22:09,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:22:09,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:09,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:09,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320027732] [2025-03-03 16:22:09,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320027732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:09,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:09,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301213066] [2025-03-03 16:22:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:09,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:09,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:09,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:09,268 INFO L87 Difference]: Start difference. First operand 1539 states and 2056 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:09,341 INFO L93 Difference]: Finished difference Result 2777 states and 3657 transitions. [2025-03-03 16:22:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:09,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 16:22:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:09,348 INFO L225 Difference]: With dead ends: 2777 [2025-03-03 16:22:09,348 INFO L226 Difference]: Without dead ends: 1569 [2025-03-03 16:22:09,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:09,352 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 0 mSDsluCounter, 2483 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:09,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3105 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-03-03 16:22:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2025-03-03 16:22:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1284 states have (on average 1.355140186915888) internal successors, (1740), 1307 states have internal predecessors, (1740), 147 states have call successors, (147), 111 states have call predecessors, (147), 136 states have return successors, (191), 153 states have call predecessors, (191), 145 states have call successors, (191) [2025-03-03 16:22:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2078 transitions. [2025-03-03 16:22:09,442 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2078 transitions. Word has length 66 [2025-03-03 16:22:09,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:09,442 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2078 transitions. [2025-03-03 16:22:09,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2078 transitions. [2025-03-03 16:22:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:22:09,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:09,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:09,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:22:09,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:09,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:09,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1543461508, now seen corresponding path program 1 times [2025-03-03 16:22:09,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:09,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578154621] [2025-03-03 16:22:09,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:09,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:22:09,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:22:09,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:09,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:09,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-03 16:22:09,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:09,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578154621] [2025-03-03 16:22:09,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578154621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:09,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:09,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073436287] [2025-03-03 16:22:09,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:09,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:09,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:09,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:09,551 INFO L87 Difference]: Start difference. First operand 1569 states and 2078 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:10,235 INFO L93 Difference]: Finished difference Result 2801 states and 3594 transitions. [2025-03-03 16:22:10,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:22:10,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-03 16:22:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:10,244 INFO L225 Difference]: With dead ends: 2801 [2025-03-03 16:22:10,244 INFO L226 Difference]: Without dead ends: 1791 [2025-03-03 16:22:10,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:22:10,247 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 903 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:10,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 1368 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2025-03-03 16:22:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1510. [2025-03-03 16:22:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1241 states have (on average 1.3521353746978244) internal successors, (1678), 1259 states have internal predecessors, (1678), 141 states have call successors, (141), 106 states have call predecessors, (141), 126 states have return successors, (176), 146 states have call predecessors, (176), 139 states have call successors, (176) [2025-03-03 16:22:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1995 transitions. [2025-03-03 16:22:10,308 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1995 transitions. Word has length 66 [2025-03-03 16:22:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:10,309 INFO L471 AbstractCegarLoop]: Abstraction has 1510 states and 1995 transitions. [2025-03-03 16:22:10,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:10,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1995 transitions. [2025-03-03 16:22:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 16:22:10,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:10,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:10,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:22:10,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:10,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash 674296445, now seen corresponding path program 1 times [2025-03-03 16:22:10,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:10,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56808875] [2025-03-03 16:22:10,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:10,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:10,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 16:22:10,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 16:22:10,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:10,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:10,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:10,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56808875] [2025-03-03 16:22:10,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56808875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:10,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:10,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:22:10,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114062958] [2025-03-03 16:22:10,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:10,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:22:10,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:10,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:22:10,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:22:10,363 INFO L87 Difference]: Start difference. First operand 1510 states and 1995 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:10,808 INFO L93 Difference]: Finished difference Result 3756 states and 4845 transitions. [2025-03-03 16:22:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:22:10,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-03-03 16:22:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:10,820 INFO L225 Difference]: With dead ends: 3756 [2025-03-03 16:22:10,820 INFO L226 Difference]: Without dead ends: 2578 [2025-03-03 16:22:10,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:10,825 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 861 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:10,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 704 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:10,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2025-03-03 16:22:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2574. [2025-03-03 16:22:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2574 states, 2065 states have (on average 1.2944309927360775) internal successors, (2673), 2099 states have internal predecessors, (2673), 257 states have call successors, (257), 205 states have call predecessors, (257), 250 states have return successors, (364), 271 states have call predecessors, (364), 255 states have call successors, (364) [2025-03-03 16:22:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 3294 transitions. [2025-03-03 16:22:10,940 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 3294 transitions. Word has length 66 [2025-03-03 16:22:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:10,940 INFO L471 AbstractCegarLoop]: Abstraction has 2574 states and 3294 transitions. [2025-03-03 16:22:10,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 16:22:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 3294 transitions. [2025-03-03 16:22:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:22:10,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:10,941 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:10,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:22:10,942 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash -763067021, now seen corresponding path program 1 times [2025-03-03 16:22:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:10,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368724701] [2025-03-03 16:22:10,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:10,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:22:10,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:22:10,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:10,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:10,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:10,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368724701] [2025-03-03 16:22:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368724701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:10,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:10,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824820919] [2025-03-03 16:22:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:10,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:10,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:10,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:10,999 INFO L87 Difference]: Start difference. First operand 2574 states and 3294 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:11,132 INFO L93 Difference]: Finished difference Result 5673 states and 7182 transitions. [2025-03-03 16:22:11,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:11,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-03 16:22:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:11,148 INFO L225 Difference]: With dead ends: 5673 [2025-03-03 16:22:11,148 INFO L226 Difference]: Without dead ends: 3431 [2025-03-03 16:22:11,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:11,154 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 102 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:11,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1232 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2025-03-03 16:22:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3351. [2025-03-03 16:22:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 2671 states have (on average 1.2796705353800075) internal successors, (3418), 2710 states have internal predecessors, (3418), 341 states have call successors, (341), 278 states have call predecessors, (341), 337 states have return successors, (468), 364 states have call predecessors, (468), 339 states have call successors, (468) [2025-03-03 16:22:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4227 transitions. [2025-03-03 16:22:11,367 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4227 transitions. Word has length 67 [2025-03-03 16:22:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:11,367 INFO L471 AbstractCegarLoop]: Abstraction has 3351 states and 4227 transitions. [2025-03-03 16:22:11,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4227 transitions. [2025-03-03 16:22:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 16:22:11,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:11,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:11,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:22:11,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:11,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:11,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1628587121, now seen corresponding path program 1 times [2025-03-03 16:22:11,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:11,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051630219] [2025-03-03 16:22:11,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:11,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:11,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 16:22:11,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 16:22:11,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:11,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:11,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051630219] [2025-03-03 16:22:11,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051630219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:11,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:11,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694801675] [2025-03-03 16:22:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:11,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:11,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:11,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:11,397 INFO L87 Difference]: Start difference. First operand 3351 states and 4227 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:11,557 INFO L93 Difference]: Finished difference Result 6710 states and 8362 transitions. [2025-03-03 16:22:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:11,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-03 16:22:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:11,572 INFO L225 Difference]: With dead ends: 6710 [2025-03-03 16:22:11,572 INFO L226 Difference]: Without dead ends: 3690 [2025-03-03 16:22:11,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:11,578 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 589 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:11,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 758 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:11,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-03-03 16:22:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3629. [2025-03-03 16:22:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3629 states, 2892 states have (on average 1.2731673582295988) internal successors, (3682), 2933 states have internal predecessors, (3682), 369 states have call successors, (369), 303 states have call predecessors, (369), 366 states have return successors, (500), 394 states have call predecessors, (500), 367 states have call successors, (500) [2025-03-03 16:22:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 4551 transitions. [2025-03-03 16:22:11,743 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 4551 transitions. Word has length 73 [2025-03-03 16:22:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:11,743 INFO L471 AbstractCegarLoop]: Abstraction has 3629 states and 4551 transitions. [2025-03-03 16:22:11,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 16:22:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 4551 transitions. [2025-03-03 16:22:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:22:11,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:11,744 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:11,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:22:11,744 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:11,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:11,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1038417396, now seen corresponding path program 1 times [2025-03-03 16:22:11,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:11,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835887418] [2025-03-03 16:22:11,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:11,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:22:11,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:22:11,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:11,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:11,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:11,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835887418] [2025-03-03 16:22:11,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835887418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:11,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:11,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 16:22:11,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162286799] [2025-03-03 16:22:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:11,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:22:11,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:11,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:22:11,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:22:11,823 INFO L87 Difference]: Start difference. First operand 3629 states and 4551 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:12,214 INFO L93 Difference]: Finished difference Result 4428 states and 5519 transitions. [2025-03-03 16:22:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2025-03-03 16:22:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:12,231 INFO L225 Difference]: With dead ends: 4428 [2025-03-03 16:22:12,231 INFO L226 Difference]: Without dead ends: 4425 [2025-03-03 16:22:12,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:12,233 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 1153 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:12,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 741 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:22:12,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4425 states. [2025-03-03 16:22:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4425 to 4091. [2025-03-03 16:22:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 3247 states have (on average 1.2630120110871574) internal successors, (4101), 3291 states have internal predecessors, (4101), 419 states have call successors, (419), 347 states have call predecessors, (419), 423 states have return successors, (577), 454 states have call predecessors, (577), 418 states have call successors, (577) [2025-03-03 16:22:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 5097 transitions. [2025-03-03 16:22:12,549 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 5097 transitions. Word has length 75 [2025-03-03 16:22:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:12,549 INFO L471 AbstractCegarLoop]: Abstraction has 4091 states and 5097 transitions. [2025-03-03 16:22:12,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 5097 transitions. [2025-03-03 16:22:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 16:22:12,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:12,554 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:12,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:22:12,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:12,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:12,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2126693998, now seen corresponding path program 1 times [2025-03-03 16:22:12,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:12,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203674245] [2025-03-03 16:22:12,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:12,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:12,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:22:12,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:22:12,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:12,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:12,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:12,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203674245] [2025-03-03 16:22:12,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203674245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:22:12,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677881832] [2025-03-03 16:22:12,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:12,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:22:12,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:12,657 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:22:12,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:22:12,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:22:12,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:22:12,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:12,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:12,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 16:22:12,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:22:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:12,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:22:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677881832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:22:13,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:22:13,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-03-03 16:22:13,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258518425] [2025-03-03 16:22:13,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:22:13,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:22:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:13,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:22:13,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:13,033 INFO L87 Difference]: Start difference. First operand 4091 states and 5097 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:22:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:13,650 INFO L93 Difference]: Finished difference Result 7942 states and 9774 transitions. [2025-03-03 16:22:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 16:22:13,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 76 [2025-03-03 16:22:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:13,678 INFO L225 Difference]: With dead ends: 7942 [2025-03-03 16:22:13,679 INFO L226 Difference]: Without dead ends: 7939 [2025-03-03 16:22:13,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:13,683 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 984 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 2979 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:13,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 2979 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:22:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7939 states. [2025-03-03 16:22:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7939 to 7534. [2025-03-03 16:22:14,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7534 states, 5948 states have (on average 1.245796906523201) internal successors, (7410), 6027 states have internal predecessors, (7410), 778 states have call successors, (778), 661 states have call predecessors, (778), 806 states have return successors, (1078), 847 states have call predecessors, (1078), 777 states have call successors, (1078) [2025-03-03 16:22:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7534 states to 7534 states and 9266 transitions. [2025-03-03 16:22:14,112 INFO L78 Accepts]: Start accepts. Automaton has 7534 states and 9266 transitions. Word has length 76 [2025-03-03 16:22:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:14,113 INFO L471 AbstractCegarLoop]: Abstraction has 7534 states and 9266 transitions. [2025-03-03 16:22:14,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 16:22:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7534 states and 9266 transitions. [2025-03-03 16:22:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 16:22:14,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:14,114 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:14,121 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-03 16:22:14,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 16:22:14,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:14,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1457526166, now seen corresponding path program 2 times [2025-03-03 16:22:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:14,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24773659] [2025-03-03 16:22:14,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 16:22:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:14,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-03-03 16:22:14,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 16:22:14,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 16:22:14,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24773659] [2025-03-03 16:22:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24773659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:14,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330054100] [2025-03-03 16:22:14,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:14,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:14,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:14,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:14,356 INFO L87 Difference]: Start difference. First operand 7534 states and 9266 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:14,535 INFO L93 Difference]: Finished difference Result 9959 states and 12289 transitions. [2025-03-03 16:22:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:14,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2025-03-03 16:22:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:14,550 INFO L225 Difference]: With dead ends: 9959 [2025-03-03 16:22:14,551 INFO L226 Difference]: Without dead ends: 3735 [2025-03-03 16:22:14,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:14,561 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 594 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:14,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 812 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2025-03-03 16:22:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 2932. [2025-03-03 16:22:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2932 states, 2350 states have (on average 1.2561702127659575) internal successors, (2952), 2375 states have internal predecessors, (2952), 298 states have call successors, (298), 244 states have call predecessors, (298), 282 states have return successors, (379), 314 states have call predecessors, (379), 297 states have call successors, (379) [2025-03-03 16:22:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 3629 transitions. [2025-03-03 16:22:14,708 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 3629 transitions. Word has length 79 [2025-03-03 16:22:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:14,708 INFO L471 AbstractCegarLoop]: Abstraction has 2932 states and 3629 transitions. [2025-03-03 16:22:14,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-03 16:22:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3629 transitions. [2025-03-03 16:22:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 16:22:14,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:14,710 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:14,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:22:14,710 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:14,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash -505836487, now seen corresponding path program 1 times [2025-03-03 16:22:14,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:14,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981284563] [2025-03-03 16:22:14,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:14,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:14,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 16:22:14,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 16:22:14,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:14,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 16:22:14,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:14,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981284563] [2025-03-03 16:22:14,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981284563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:14,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:14,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157982600] [2025-03-03 16:22:14,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:14,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:14,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:14,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:14,797 INFO L87 Difference]: Start difference. First operand 2932 states and 3629 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:15,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:15,969 INFO L93 Difference]: Finished difference Result 8113 states and 9889 transitions. [2025-03-03 16:22:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 16:22:15,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2025-03-03 16:22:15,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:15,994 INFO L225 Difference]: With dead ends: 8113 [2025-03-03 16:22:15,994 INFO L226 Difference]: Without dead ends: 4789 [2025-03-03 16:22:16,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 16:22:16,003 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 800 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:16,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1754 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2025-03-03 16:22:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 4597. [2025-03-03 16:22:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4597 states, 3632 states have (on average 1.222466960352423) internal successors, (4440), 3688 states have internal predecessors, (4440), 479 states have call successors, (479), 403 states have call predecessors, (479), 484 states have return successors, (672), 507 states have call predecessors, (672), 478 states have call successors, (672) [2025-03-03 16:22:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 5591 transitions. [2025-03-03 16:22:16,259 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 5591 transitions. Word has length 85 [2025-03-03 16:22:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:16,259 INFO L471 AbstractCegarLoop]: Abstraction has 4597 states and 5591 transitions. [2025-03-03 16:22:16,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 5591 transitions. [2025-03-03 16:22:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:22:16,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:16,261 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:16,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:22:16,261 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:16,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash -116700036, now seen corresponding path program 1 times [2025-03-03 16:22:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:16,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077174772] [2025-03-03 16:22:16,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:16,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:22:16,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:22:16,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:16,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:16,345 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:22:16,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:16,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077174772] [2025-03-03 16:22:16,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077174772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:16,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:16,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 16:22:16,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586429615] [2025-03-03 16:22:16,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:16,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 16:22:16,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:16,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 16:22:16,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 16:22:16,347 INFO L87 Difference]: Start difference. First operand 4597 states and 5591 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:17,311 INFO L93 Difference]: Finished difference Result 7459 states and 9056 transitions. [2025-03-03 16:22:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 16:22:17,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-03-03 16:22:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:17,325 INFO L225 Difference]: With dead ends: 7459 [2025-03-03 16:22:17,325 INFO L226 Difference]: Without dead ends: 3718 [2025-03-03 16:22:17,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:22:17,334 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 1519 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:17,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 1845 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:22:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2025-03-03 16:22:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 3378. [2025-03-03 16:22:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 2671 states have (on average 1.2175215275177835) internal successors, (3252), 2714 states have internal predecessors, (3252), 348 states have call successors, (348), 286 states have call predecessors, (348), 357 states have return successors, (467), 379 states have call predecessors, (467), 347 states have call successors, (467) [2025-03-03 16:22:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 4067 transitions. [2025-03-03 16:22:17,556 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 4067 transitions. Word has length 95 [2025-03-03 16:22:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:17,556 INFO L471 AbstractCegarLoop]: Abstraction has 3378 states and 4067 transitions. [2025-03-03 16:22:17,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 16:22:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 4067 transitions. [2025-03-03 16:22:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 16:22:17,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:17,559 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, 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] [2025-03-03 16:22:17,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:22:17,560 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:17,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:17,560 INFO L85 PathProgramCache]: Analyzing trace with hash 19865835, now seen corresponding path program 1 times [2025-03-03 16:22:17,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:17,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384739702] [2025-03-03 16:22:17,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:17,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:17,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 16:22:17,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 16:22:17,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:17,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-03 16:22:17,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:17,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384739702] [2025-03-03 16:22:17,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384739702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:22:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949760189] [2025-03-03 16:22:17,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:17,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:22:17,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:22:17,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:22:17,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:22:17,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 16:22:17,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 16:22:17,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:17,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:17,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 16:22:17,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:22:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 16:22:17,827 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:22:17,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949760189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:17,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:22:17,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 16:22:17,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588478315] [2025-03-03 16:22:17,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:17,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:17,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:17,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:17,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:22:17,829 INFO L87 Difference]: Start difference. First operand 3378 states and 4067 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 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-03 16:22:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:17,915 INFO L93 Difference]: Finished difference Result 4816 states and 5773 transitions. [2025-03-03 16:22:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:17,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 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 146 [2025-03-03 16:22:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:17,924 INFO L225 Difference]: With dead ends: 4816 [2025-03-03 16:22:17,924 INFO L226 Difference]: Without dead ends: 1770 [2025-03-03 16:22:17,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:22:17,930 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 0 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3086 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-03 16:22:17,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3086 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-03-03 16:22:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2025-03-03 16:22:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1472 states have (on average 1.2438858695652173) internal successors, (1831), 1486 states have internal predecessors, (1831), 151 states have call successors, (151), 110 states have call predecessors, (151), 145 states have return successors, (204), 174 states have call predecessors, (204), 150 states have call successors, (204) [2025-03-03 16:22:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2186 transitions. [2025-03-03 16:22:18,011 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2186 transitions. Word has length 146 [2025-03-03 16:22:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:18,011 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2186 transitions. [2025-03-03 16:22:18,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 5 states have internal predecessors, (107), 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-03 16:22:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2186 transitions. [2025-03-03 16:22:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:18,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:18,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:18,021 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-03 16:22:18,214 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,SelfDestructingSolverStorable15 [2025-03-03 16:22:18,215 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:18,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1558049249, now seen corresponding path program 1 times [2025-03-03 16:22:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:18,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152012348] [2025-03-03 16:22:18,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:18,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:18,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:18,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:18,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:18,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:18,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152012348] [2025-03-03 16:22:18,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152012348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:18,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:18,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:22:18,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65067326] [2025-03-03 16:22:18,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:18,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:22:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:18,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:22:18,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:18,262 INFO L87 Difference]: Start difference. First operand 1770 states and 2186 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:18,327 INFO L93 Difference]: Finished difference Result 2081 states and 2660 transitions. [2025-03-03 16:22:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:22:18,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-03-03 16:22:18,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:18,334 INFO L225 Difference]: With dead ends: 2081 [2025-03-03 16:22:18,334 INFO L226 Difference]: Without dead ends: 1770 [2025-03-03 16:22:18,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:22:18,336 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 481 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:18,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 750 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:22:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-03-03 16:22:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2025-03-03 16:22:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1472 states have (on average 1.2432065217391304) internal successors, (1830), 1486 states have internal predecessors, (1830), 151 states have call successors, (151), 110 states have call predecessors, (151), 145 states have return successors, (204), 174 states have call predecessors, (204), 150 states have call successors, (204) [2025-03-03 16:22:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2185 transitions. [2025-03-03 16:22:18,416 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2185 transitions. Word has length 145 [2025-03-03 16:22:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:18,417 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2185 transitions. [2025-03-03 16:22:18,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2185 transitions. [2025-03-03 16:22:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:18,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:18,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:18,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:22:18,422 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:18,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1413639554, now seen corresponding path program 1 times [2025-03-03 16:22:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:18,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871308668] [2025-03-03 16:22:18,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:18,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:18,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:18,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:18,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:18,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871308668] [2025-03-03 16:22:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871308668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:18,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:18,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582336158] [2025-03-03 16:22:18,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:18,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:18,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:18,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:18,513 INFO L87 Difference]: Start difference. First operand 1770 states and 2185 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:19,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:19,017 INFO L93 Difference]: Finished difference Result 2416 states and 3185 transitions. [2025-03-03 16:22:19,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:22:19,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:19,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:19,024 INFO L225 Difference]: With dead ends: 2416 [2025-03-03 16:22:19,024 INFO L226 Difference]: Without dead ends: 2111 [2025-03-03 16:22:19,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:19,025 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 1082 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:19,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 1544 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:22:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2025-03-03 16:22:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2088. [2025-03-03 16:22:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 1765 states have (on average 1.293484419263456) internal successors, (2283), 1780 states have internal predecessors, (2283), 169 states have call successors, (169), 116 states have call predecessors, (169), 152 states have return successors, (223), 192 states have call predecessors, (223), 168 states have call successors, (223) [2025-03-03 16:22:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2675 transitions. [2025-03-03 16:22:19,115 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2675 transitions. Word has length 145 [2025-03-03 16:22:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:19,115 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2675 transitions. [2025-03-03 16:22:19,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2675 transitions. [2025-03-03 16:22:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:19,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:19,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:19,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:22:19,118 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:19,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:19,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2009825980, now seen corresponding path program 1 times [2025-03-03 16:22:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:19,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300492985] [2025-03-03 16:22:19,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:19,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:19,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:19,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:19,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300492985] [2025-03-03 16:22:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300492985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946538440] [2025-03-03 16:22:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:19,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:19,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:19,230 INFO L87 Difference]: Start difference. First operand 2088 states and 2675 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:19,907 INFO L93 Difference]: Finished difference Result 3111 states and 4274 transitions. [2025-03-03 16:22:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:19,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:19,914 INFO L225 Difference]: With dead ends: 3111 [2025-03-03 16:22:19,914 INFO L226 Difference]: Without dead ends: 2488 [2025-03-03 16:22:19,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:19,916 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 1086 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 2888 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:19,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 2888 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2025-03-03 16:22:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2385. [2025-03-03 16:22:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2037 states have (on average 1.3225331369661266) internal successors, (2694), 2053 states have internal predecessors, (2694), 187 states have call successors, (187), 122 states have call predecessors, (187), 159 states have return successors, (244), 211 states have call predecessors, (244), 186 states have call successors, (244) [2025-03-03 16:22:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3125 transitions. [2025-03-03 16:22:20,049 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3125 transitions. Word has length 145 [2025-03-03 16:22:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:20,050 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3125 transitions. [2025-03-03 16:22:20,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:20,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3125 transitions. [2025-03-03 16:22:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:20,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:20,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:20,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:22:20,054 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:20,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:20,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1536307037, now seen corresponding path program 1 times [2025-03-03 16:22:20,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:20,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229664146] [2025-03-03 16:22:20,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:20,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:20,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:20,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:20,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:20,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:20,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:20,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229664146] [2025-03-03 16:22:20,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229664146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:20,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:20,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336705108] [2025-03-03 16:22:20,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:20,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:20,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:20,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:20,180 INFO L87 Difference]: Start difference. First operand 2385 states and 3125 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:21,010 INFO L93 Difference]: Finished difference Result 4054 states and 5727 transitions. [2025-03-03 16:22:21,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:21,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:21,019 INFO L225 Difference]: With dead ends: 4054 [2025-03-03 16:22:21,020 INFO L226 Difference]: Without dead ends: 3134 [2025-03-03 16:22:21,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:21,023 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 1081 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 2872 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:21,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 2872 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2025-03-03 16:22:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 3016. [2025-03-03 16:22:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3016 states, 2616 states have (on average 1.3696483180428134) internal successors, (3583), 2636 states have internal predecessors, (3583), 223 states have call successors, (223), 134 states have call predecessors, (223), 175 states have return successors, (292), 249 states have call predecessors, (292), 222 states have call successors, (292) [2025-03-03 16:22:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 4098 transitions. [2025-03-03 16:22:21,159 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 4098 transitions. Word has length 145 [2025-03-03 16:22:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:21,159 INFO L471 AbstractCegarLoop]: Abstraction has 3016 states and 4098 transitions. [2025-03-03 16:22:21,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 4098 transitions. [2025-03-03 16:22:21,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:21,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:21,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:21,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:22:21,163 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:21,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1105390236, now seen corresponding path program 1 times [2025-03-03 16:22:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:21,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479845398] [2025-03-03 16:22:21,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:21,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:21,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:21,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:21,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:21,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:21,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479845398] [2025-03-03 16:22:21,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479845398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:21,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:21,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:21,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405675503] [2025-03-03 16:22:21,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:21,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:21,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:21,276 INFO L87 Difference]: Start difference. First operand 3016 states and 4098 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:22,032 INFO L93 Difference]: Finished difference Result 6083 states and 8922 transitions. [2025-03-03 16:22:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:22,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:22,044 INFO L225 Difference]: With dead ends: 6083 [2025-03-03 16:22:22,044 INFO L226 Difference]: Without dead ends: 4532 [2025-03-03 16:22:22,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:22,049 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 1076 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 2860 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:22,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 2860 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2025-03-03 16:22:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4383. [2025-03-03 16:22:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4383 states, 3873 states have (on average 1.4332558739994836) internal successors, (5551), 3907 states have internal predecessors, (5551), 295 states have call successors, (295), 158 states have call predecessors, (295), 213 states have return successors, (412), 325 states have call predecessors, (412), 294 states have call successors, (412) [2025-03-03 16:22:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6258 transitions. [2025-03-03 16:22:22,221 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6258 transitions. Word has length 145 [2025-03-03 16:22:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:22,222 INFO L471 AbstractCegarLoop]: Abstraction has 4383 states and 6258 transitions. [2025-03-03 16:22:22,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6258 transitions. [2025-03-03 16:22:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:22,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:22,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:22,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:22:22,226 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:22,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash 16888963, now seen corresponding path program 1 times [2025-03-03 16:22:22,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:22,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202021800] [2025-03-03 16:22:22,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:22,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:22,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:22,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:22,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:22,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:22,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202021800] [2025-03-03 16:22:22,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202021800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:22,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:22,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:22,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041312102] [2025-03-03 16:22:22,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:22,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:22,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:22,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:22,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:22,328 INFO L87 Difference]: Start difference. First operand 4383 states and 6258 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:23,181 INFO L93 Difference]: Finished difference Result 10542 states and 16156 transitions. [2025-03-03 16:22:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:23,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:23,199 INFO L225 Difference]: With dead ends: 10542 [2025-03-03 16:22:23,199 INFO L226 Difference]: Without dead ends: 7624 [2025-03-03 16:22:23,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:23,205 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 1071 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:23,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 2848 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:23,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7624 states. [2025-03-03 16:22:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7624 to 7414. [2025-03-03 16:22:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7414 states, 6666 states have (on average 1.5036003600360035) internal successors, (10023), 6746 states have internal predecessors, (10023), 439 states have call successors, (439), 206 states have call predecessors, (439), 307 states have return successors, (748), 477 states have call predecessors, (748), 438 states have call successors, (748) [2025-03-03 16:22:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7414 states to 7414 states and 11210 transitions. [2025-03-03 16:22:23,484 INFO L78 Accepts]: Start accepts. Automaton has 7414 states and 11210 transitions. Word has length 145 [2025-03-03 16:22:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:23,484 INFO L471 AbstractCegarLoop]: Abstraction has 7414 states and 11210 transitions. [2025-03-03 16:22:23,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 7414 states and 11210 transitions. [2025-03-03 16:22:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:23,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:23,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:23,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:22:23,490 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:23,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1886571132, now seen corresponding path program 1 times [2025-03-03 16:22:23,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995062453] [2025-03-03 16:22:23,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:23,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:23,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:23,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:23,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:23,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:23,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995062453] [2025-03-03 16:22:23,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995062453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:23,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:23,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449455029] [2025-03-03 16:22:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:23,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:23,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:23,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:23,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:23,562 INFO L87 Difference]: Start difference. First operand 7414 states and 11210 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:24,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:24,156 INFO L93 Difference]: Finished difference Result 14691 states and 23397 transitions. [2025-03-03 16:22:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:24,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:24,184 INFO L225 Difference]: With dead ends: 14691 [2025-03-03 16:22:24,185 INFO L226 Difference]: Without dead ends: 8742 [2025-03-03 16:22:24,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:24,198 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 818 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:24,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1146 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8742 states. [2025-03-03 16:22:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8742 to 7414. [2025-03-03 16:22:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7414 states, 6666 states have (on average 1.501050105010501) internal successors, (10006), 6746 states have internal predecessors, (10006), 439 states have call successors, (439), 206 states have call predecessors, (439), 307 states have return successors, (748), 477 states have call predecessors, (748), 438 states have call successors, (748) [2025-03-03 16:22:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7414 states to 7414 states and 11193 transitions. [2025-03-03 16:22:24,496 INFO L78 Accepts]: Start accepts. Automaton has 7414 states and 11193 transitions. Word has length 145 [2025-03-03 16:22:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:24,496 INFO L471 AbstractCegarLoop]: Abstraction has 7414 states and 11193 transitions. [2025-03-03 16:22:24,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7414 states and 11193 transitions. [2025-03-03 16:22:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:24,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:24,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:22:24,501 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash -285405085, now seen corresponding path program 1 times [2025-03-03 16:22:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:24,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768795290] [2025-03-03 16:22:24,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:24,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:24,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:24,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:24,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:24,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:24,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:24,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:24,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768795290] [2025-03-03 16:22:24,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768795290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:24,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:24,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:24,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148996945] [2025-03-03 16:22:24,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:24,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:24,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:24,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:24,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:24,571 INFO L87 Difference]: Start difference. First operand 7414 states and 11193 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:25,141 INFO L93 Difference]: Finished difference Result 14608 states and 23197 transitions. [2025-03-03 16:22:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:25,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:25,170 INFO L225 Difference]: With dead ends: 14608 [2025-03-03 16:22:25,170 INFO L226 Difference]: Without dead ends: 8659 [2025-03-03 16:22:25,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:25,186 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 815 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:25,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1138 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8659 states. [2025-03-03 16:22:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8659 to 7414. [2025-03-03 16:22:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7414 states, 6666 states have (on average 1.4984998499849984) internal successors, (9989), 6746 states have internal predecessors, (9989), 439 states have call successors, (439), 206 states have call predecessors, (439), 307 states have return successors, (748), 477 states have call predecessors, (748), 438 states have call successors, (748) [2025-03-03 16:22:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7414 states to 7414 states and 11176 transitions. [2025-03-03 16:22:25,496 INFO L78 Accepts]: Start accepts. Automaton has 7414 states and 11176 transitions. Word has length 145 [2025-03-03 16:22:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:25,497 INFO L471 AbstractCegarLoop]: Abstraction has 7414 states and 11176 transitions. [2025-03-03 16:22:25,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7414 states and 11176 transitions. [2025-03-03 16:22:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:25,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:25,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:25,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:22:25,501 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:25,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash -926491228, now seen corresponding path program 1 times [2025-03-03 16:22:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:25,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469415673] [2025-03-03 16:22:25,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:25,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:25,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:25,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:25,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:25,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:25,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:25,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469415673] [2025-03-03 16:22:25,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469415673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:25,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:25,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:25,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602964511] [2025-03-03 16:22:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:25,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:25,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:25,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:25,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:25,603 INFO L87 Difference]: Start difference. First operand 7414 states and 11176 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:26,306 INFO L93 Difference]: Finished difference Result 14525 states and 22997 transitions. [2025-03-03 16:22:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:26,331 INFO L225 Difference]: With dead ends: 14525 [2025-03-03 16:22:26,331 INFO L226 Difference]: Without dead ends: 8576 [2025-03-03 16:22:26,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:26,344 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 812 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:26,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1130 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2025-03-03 16:22:26,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 7414. [2025-03-03 16:22:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7414 states, 6666 states have (on average 1.4959495949594959) internal successors, (9972), 6746 states have internal predecessors, (9972), 439 states have call successors, (439), 206 states have call predecessors, (439), 307 states have return successors, (748), 477 states have call predecessors, (748), 438 states have call successors, (748) [2025-03-03 16:22:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7414 states to 7414 states and 11159 transitions. [2025-03-03 16:22:26,720 INFO L78 Accepts]: Start accepts. Automaton has 7414 states and 11159 transitions. Word has length 145 [2025-03-03 16:22:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:26,720 INFO L471 AbstractCegarLoop]: Abstraction has 7414 states and 11159 transitions. [2025-03-03 16:22:26,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7414 states and 11159 transitions. [2025-03-03 16:22:26,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:26,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:26,724 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:26,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:22:26,725 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:26,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:26,725 INFO L85 PathProgramCache]: Analyzing trace with hash 299754563, now seen corresponding path program 1 times [2025-03-03 16:22:26,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:26,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184433445] [2025-03-03 16:22:26,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:26,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:26,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:26,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:26,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:26,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:26,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184433445] [2025-03-03 16:22:26,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184433445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:26,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:26,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:26,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620300910] [2025-03-03 16:22:26,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:26,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:26,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:26,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:26,804 INFO L87 Difference]: Start difference. First operand 7414 states and 11159 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:27,772 INFO L93 Difference]: Finished difference Result 20289 states and 32381 transitions. [2025-03-03 16:22:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:27,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:27,825 INFO L225 Difference]: With dead ends: 20289 [2025-03-03 16:22:27,825 INFO L226 Difference]: Without dead ends: 14340 [2025-03-03 16:22:27,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:27,844 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 1042 mSDsluCounter, 2089 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:27,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 2779 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:27,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14340 states. [2025-03-03 16:22:28,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14340 to 14070. [2025-03-03 16:22:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14070 states, 12792 states have (on average 1.5545653533458412) internal successors, (19886), 13018 states have internal predecessors, (19886), 727 states have call successors, (727), 302 states have call predecessors, (727), 549 states have return successors, (1804), 781 states have call predecessors, (1804), 726 states have call successors, (1804) [2025-03-03 16:22:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14070 states to 14070 states and 22417 transitions. [2025-03-03 16:22:28,456 INFO L78 Accepts]: Start accepts. Automaton has 14070 states and 22417 transitions. Word has length 145 [2025-03-03 16:22:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:28,456 INFO L471 AbstractCegarLoop]: Abstraction has 14070 states and 22417 transitions. [2025-03-03 16:22:28,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 14070 states and 22417 transitions. [2025-03-03 16:22:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:28,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:28,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:28,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 16:22:28,463 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:28,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1586236868, now seen corresponding path program 1 times [2025-03-03 16:22:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:28,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830421903] [2025-03-03 16:22:28,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:28,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:28,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:28,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:28,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:28,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:28,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:28,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830421903] [2025-03-03 16:22:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830421903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:28,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:22:28,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531394940] [2025-03-03 16:22:28,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:28,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:22:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:28,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:22:28,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:22:28,522 INFO L87 Difference]: Start difference. First operand 14070 states and 22417 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:29,436 INFO L93 Difference]: Finished difference Result 29615 states and 49349 transitions. [2025-03-03 16:22:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:22:29,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:29,487 INFO L225 Difference]: With dead ends: 29615 [2025-03-03 16:22:29,487 INFO L226 Difference]: Without dead ends: 17010 [2025-03-03 16:22:29,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:29,516 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 808 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:29,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1116 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:22:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17010 states. [2025-03-03 16:22:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17010 to 14070. [2025-03-03 16:22:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14070 states, 12792 states have (on average 1.5519856160100063) internal successors, (19853), 13018 states have internal predecessors, (19853), 727 states have call successors, (727), 302 states have call predecessors, (727), 549 states have return successors, (1804), 781 states have call predecessors, (1804), 726 states have call successors, (1804) [2025-03-03 16:22:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14070 states to 14070 states and 22384 transitions. [2025-03-03 16:22:30,712 INFO L78 Accepts]: Start accepts. Automaton has 14070 states and 22384 transitions. Word has length 145 [2025-03-03 16:22:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:30,712 INFO L471 AbstractCegarLoop]: Abstraction has 14070 states and 22384 transitions. [2025-03-03 16:22:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 14070 states and 22384 transitions. [2025-03-03 16:22:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:30,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:30,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:30,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 16:22:30,720 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash -727568349, now seen corresponding path program 1 times [2025-03-03 16:22:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:30,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006801907] [2025-03-03 16:22:30,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:30,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:30,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:30,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:30,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:30,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:30,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:30,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006801907] [2025-03-03 16:22:30,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006801907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:30,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:30,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:30,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540074557] [2025-03-03 16:22:30,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:30,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:30,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:30,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:30,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:30,830 INFO L87 Difference]: Start difference. First operand 14070 states and 22384 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:32,496 INFO L93 Difference]: Finished difference Result 44191 states and 73935 transitions. [2025-03-03 16:22:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:32,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:32,603 INFO L225 Difference]: With dead ends: 44191 [2025-03-03 16:22:32,604 INFO L226 Difference]: Without dead ends: 31586 [2025-03-03 16:22:32,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:32,647 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 1313 mSDsluCounter, 2055 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:32,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 2735 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31586 states. [2025-03-03 16:22:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31586 to 28906. [2025-03-03 16:22:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28906 states, 26438 states have (on average 1.6008397004311976) internal successors, (42323), 27118 states have internal predecessors, (42323), 1271 states have call successors, (1271), 494 states have call predecessors, (1271), 1195 states have return successors, (5420), 1357 states have call predecessors, (5420), 1270 states have call successors, (5420) [2025-03-03 16:22:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28906 states to 28906 states and 49014 transitions. [2025-03-03 16:22:34,027 INFO L78 Accepts]: Start accepts. Automaton has 28906 states and 49014 transitions. Word has length 145 [2025-03-03 16:22:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:34,027 INFO L471 AbstractCegarLoop]: Abstraction has 28906 states and 49014 transitions. [2025-03-03 16:22:34,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:34,028 INFO L276 IsEmpty]: Start isEmpty. Operand 28906 states and 49014 transitions. [2025-03-03 16:22:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:34,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:34,036 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:34,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 16:22:34,036 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:34,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1910585884, now seen corresponding path program 1 times [2025-03-03 16:22:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:34,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996141972] [2025-03-03 16:22:34,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:34,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:34,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:34,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:34,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:34,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:34,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996141972] [2025-03-03 16:22:34,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996141972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:34,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11169234] [2025-03-03 16:22:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:34,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:34,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:34,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:34,112 INFO L87 Difference]: Start difference. First operand 28906 states and 49014 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:37,574 INFO L93 Difference]: Finished difference Result 95265 states and 170875 transitions. [2025-03-03 16:22:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:37,831 INFO L225 Difference]: With dead ends: 95265 [2025-03-03 16:22:37,831 INFO L226 Difference]: Without dead ends: 67824 [2025-03-03 16:22:37,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:37,922 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 1277 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 2719 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:37,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 2719 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 16:22:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67824 states. [2025-03-03 16:22:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67824 to 62715. [2025-03-03 16:22:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62715 states, 57413 states have (on average 1.6436521345339905) internal successors, (94367), 59487 states have internal predecessors, (94367), 2327 states have call successors, (2327), 878 states have call predecessors, (2327), 2973 states have return successors, (18764), 2477 states have call predecessors, (18764), 2326 states have call successors, (18764) [2025-03-03 16:22:41,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62715 states to 62715 states and 115458 transitions. [2025-03-03 16:22:41,252 INFO L78 Accepts]: Start accepts. Automaton has 62715 states and 115458 transitions. Word has length 145 [2025-03-03 16:22:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:41,252 INFO L471 AbstractCegarLoop]: Abstraction has 62715 states and 115458 transitions. [2025-03-03 16:22:41,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:41,253 INFO L276 IsEmpty]: Start isEmpty. Operand 62715 states and 115458 transitions. [2025-03-03 16:22:41,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:41,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:41,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:41,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 16:22:41,267 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:41,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1237840899, now seen corresponding path program 1 times [2025-03-03 16:22:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:41,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290139700] [2025-03-03 16:22:41,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:41,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:41,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:41,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:41,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:41,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:41,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290139700] [2025-03-03 16:22:41,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290139700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:41,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:41,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:41,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348422067] [2025-03-03 16:22:41,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:41,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:41,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:41,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:41,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:41,333 INFO L87 Difference]: Start difference. First operand 62715 states and 115458 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:22:48,461 INFO L93 Difference]: Finished difference Result 212666 states and 420853 transitions. [2025-03-03 16:22:48,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:22:48,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2025-03-03 16:22:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:22:49,141 INFO L225 Difference]: With dead ends: 212666 [2025-03-03 16:22:49,141 INFO L226 Difference]: Without dead ends: 151416 [2025-03-03 16:22:49,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:22:49,366 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 1243 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:22:49,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 2711 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:22:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151416 states. [2025-03-03 16:22:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151416 to 142918. [2025-03-03 16:22:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142918 states, 130554 states have (on average 1.67938937144783) internal successors, (219251), 136874 states have internal predecessors, (219251), 4375 states have call successors, (4375), 1646 states have call predecessors, (4375), 7987 states have return successors, (69964), 4653 states have call predecessors, (69964), 4374 states have call successors, (69964) [2025-03-03 16:22:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142918 states to 142918 states and 293590 transitions. [2025-03-03 16:22:57,893 INFO L78 Accepts]: Start accepts. Automaton has 142918 states and 293590 transitions. Word has length 145 [2025-03-03 16:22:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:22:57,893 INFO L471 AbstractCegarLoop]: Abstraction has 142918 states and 293590 transitions. [2025-03-03 16:22:57,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 16:22:57,894 INFO L276 IsEmpty]: Start isEmpty. Operand 142918 states and 293590 transitions. [2025-03-03 16:22:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 16:22:57,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:22:57,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:22:57,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 16:22:57,923 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:22:57,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:22:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash -46070268, now seen corresponding path program 1 times [2025-03-03 16:22:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:22:57,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802322060] [2025-03-03 16:22:57,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:22:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:22:57,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 16:22:57,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 16:22:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:22:57,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:22:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:22:57,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:22:57,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802322060] [2025-03-03 16:22:57,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802322060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:22:57,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:22:57,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:22:57,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471228747] [2025-03-03 16:22:57,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:22:57,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:22:57,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:22:57,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:22:57,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:22:57,995 INFO L87 Difference]: Start difference. First operand 142918 states and 293590 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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)