./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.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 0b8de634f132d76c1b6698e4c3a5f12df478fc7c8b9ceb30d48afc80707f7564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:35:50,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:35:50,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:35:50,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:35:50,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:35:50,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:35:50,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:35:50,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:35:50,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:35:50,643 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:35:50,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:35:50,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:35:50,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:35:50,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:35:50,644 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:35:50,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:35:50,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:35:50,644 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:35:50,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:35:50,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:35:50,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:35:50,645 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:35:50,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:35:50,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:35:50,645 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:35:50,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:35:50,645 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:35:50,645 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:35:50,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:35:50,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:35:50,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:35:50,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:35:50,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:50,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:35:50,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:35:50,647 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:35:50,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:35:50,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:35:50,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:35:50,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:35:50,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:35:50,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:35:50,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:35:50,647 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 -> 0b8de634f132d76c1b6698e4c3a5f12df478fc7c8b9ceb30d48afc80707f7564 [2025-03-08 07:35:50,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:35:50,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:35:50,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:35:50,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:35:50,898 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:35:50,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c [2025-03-08 07:35:52,010 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c444f0fc/88df07be166044eab065ef986905b379/FLAG5774fa449 [2025-03-08 07:35:52,337 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:35:52,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-1.c [2025-03-08 07:35:52,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c444f0fc/88df07be166044eab065ef986905b379/FLAG5774fa449 [2025-03-08 07:35:52,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c444f0fc/88df07be166044eab065ef986905b379 [2025-03-08 07:35:52,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:35:52,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:35:52,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:52,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:35:52,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:35:52,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2f0276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52, skipping insertion in model container [2025-03-08 07:35:52,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:35:52,538 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_3.cil+token_ring.11.cil-1.c[911,924] [2025-03-08 07:35:52,581 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_3.cil+token_ring.11.cil-1.c[8416,8429] [2025-03-08 07:35:52,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:52,662 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:35:52,676 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_3.cil+token_ring.11.cil-1.c[911,924] [2025-03-08 07:35:52,696 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_3.cil+token_ring.11.cil-1.c[8416,8429] [2025-03-08 07:35:52,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:35:52,778 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:35:52,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52 WrapperNode [2025-03-08 07:35:52,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:35:52,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:52,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:35:52,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:35:52,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,834 INFO L138 Inliner]: procedures = 77, calls = 95, calls flagged for inlining = 45, calls inlined = 45, statements flattened = 998 [2025-03-08 07:35:52,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:35:52,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:35:52,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:35:52,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:35:52,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,863 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:35:52,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,878 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:35:52,893 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:35:52,894 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:35:52,894 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:35:52,895 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (1/1) ... [2025-03-08 07:35:52,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:35:52,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:35:52,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:35:52,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:35:52,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:35:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 07:35:52,942 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 07:35:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-03-08 07:35:52,942 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-03-08 07:35:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-03-08 07:35:52,942 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-03-08 07:35:52,942 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-03-08 07:35:52,942 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-03-08 07:35:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-03-08 07:35:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-03-08 07:35:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-03-08 07:35:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-03-08 07:35:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-03-08 07:35:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-03-08 07:35:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-03-08 07:35:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-03-08 07:35:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-03-08 07:35:52,943 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-03-08 07:35:52,943 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-03-08 07:35:52,944 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-03-08 07:35:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-03-08 07:35:52,944 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-03-08 07:35:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:35:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-03-08 07:35:52,944 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-03-08 07:35:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-03-08 07:35:52,944 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-03-08 07:35:52,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:35:52,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:35:52,945 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-03-08 07:35:52,945 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-03-08 07:35:52,945 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-03-08 07:35:52,945 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-03-08 07:35:53,056 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:35:53,058 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:35:53,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-03-08 07:35:53,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-03-08 07:35:53,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-03-08 07:35:53,929 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-03-08 07:35:53,930 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:35:53,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:35:53,953 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:35:53,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:53 BoogieIcfgContainer [2025-03-08 07:35:53,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:35:53,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:35:53,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:35:53,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:35:53,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:35:52" (1/3) ... [2025-03-08 07:35:53,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75178809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:53, skipping insertion in model container [2025-03-08 07:35:53,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:35:52" (2/3) ... [2025-03-08 07:35:53,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75178809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:35:53, skipping insertion in model container [2025-03-08 07:35:53,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:35:53" (3/3) ... [2025-03-08 07:35:53,962 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-1.c [2025-03-08 07:35:53,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:35:53,979 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.11.cil-1.c that has 16 procedures, 476 locations, 1 initial locations, 18 loop locations, and 2 error locations. [2025-03-08 07:35:54,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:35:54,056 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;@ac1f9a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:35:54,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:35:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 476 states, 417 states have (on average 1.5971223021582734) internal successors, (666), 423 states have internal predecessors, (666), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 07:35:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:54,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:54,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:54,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash -979697825, now seen corresponding path program 1 times [2025-03-08 07:35:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290778428] [2025-03-08 07:35:54,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:54,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:54,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:54,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:54,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:54,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:54,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290778428] [2025-03-08 07:35:54,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290778428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:54,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:54,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:35:54,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843843062] [2025-03-08 07:35:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:54,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:35:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:54,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:35:54,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:35:54,483 INFO L87 Difference]: Start difference. First operand has 476 states, 417 states have (on average 1.5971223021582734) internal successors, (666), 423 states have internal predecessors, (666), 43 states have call successors, (43), 15 states have call predecessors, (43), 15 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:55,522 INFO L93 Difference]: Finished difference Result 1039 states and 1637 transitions. [2025-03-08 07:35:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:55,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:55,540 INFO L225 Difference]: With dead ends: 1039 [2025-03-08 07:35:55,544 INFO L226 Difference]: Without dead ends: 580 [2025-03-08 07:35:55,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:55,555 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 497 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:55,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1533 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:35:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-08 07:35:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 573. [2025-03-08 07:35:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 493 states have (on average 1.539553752535497) internal successors, (759), 500 states have internal predecessors, (759), 56 states have call successors, (56), 22 states have call predecessors, (56), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2025-03-08 07:35:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 872 transitions. [2025-03-08 07:35:55,639 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 872 transitions. Word has length 63 [2025-03-08 07:35:55,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:55,640 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 872 transitions. [2025-03-08 07:35:55,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:55,641 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 872 transitions. [2025-03-08 07:35:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:55,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:55,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:55,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:35:55,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:55,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash 24526527, now seen corresponding path program 1 times [2025-03-08 07:35:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844238289] [2025-03-08 07:35:55,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:55,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:55,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:55,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:55,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:55,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:55,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:55,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844238289] [2025-03-08 07:35:55,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844238289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:55,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:55,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:55,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486026310] [2025-03-08 07:35:55,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:55,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:55,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:55,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:55,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:55,881 INFO L87 Difference]: Start difference. First operand 573 states and 872 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:56,785 INFO L93 Difference]: Finished difference Result 928 states and 1375 transitions. [2025-03-08 07:35:56,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:35:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 63 [2025-03-08 07:35:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:56,796 INFO L225 Difference]: With dead ends: 928 [2025-03-08 07:35:56,796 INFO L226 Difference]: Without dead ends: 727 [2025-03-08 07:35:56,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:35:56,798 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 1039 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:56,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1780 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:35:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-03-08 07:35:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 681. [2025-03-08 07:35:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 579 states have (on average 1.5215889464594128) internal successors, (881), 588 states have internal predecessors, (881), 69 states have call successors, (69), 29 states have call predecessors, (69), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2025-03-08 07:35:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1028 transitions. [2025-03-08 07:35:56,843 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1028 transitions. Word has length 63 [2025-03-08 07:35:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:56,843 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1028 transitions. [2025-03-08 07:35:56,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:35:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1028 transitions. [2025-03-08 07:35:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 07:35:56,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:56,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:35:56,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:35:56,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:56,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash 16767168, now seen corresponding path program 1 times [2025-03-08 07:35:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:56,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516494378] [2025-03-08 07:35:56,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:56,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 07:35:56,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 07:35:56,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:56,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:56,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:56,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516494378] [2025-03-08 07:35:56,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516494378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:56,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:56,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:35:56,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325386534] [2025-03-08 07:35:56,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:56,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:35:56,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:56,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:35:56,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:35:56,962 INFO L87 Difference]: Start difference. First operand 681 states and 1028 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:35:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:58,152 INFO L93 Difference]: Finished difference Result 2057 states and 3006 transitions. [2025-03-08 07:35:58,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:35:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 63 [2025-03-08 07:35:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:58,163 INFO L225 Difference]: With dead ends: 2057 [2025-03-08 07:35:58,164 INFO L226 Difference]: Without dead ends: 1736 [2025-03-08 07:35:58,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:35:58,179 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 3211 mSDsluCounter, 1488 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3229 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:58,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3229 Valid, 1970 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:35:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2025-03-08 07:35:58,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1689. [2025-03-08 07:35:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1382 states have (on average 1.4327062228654124) internal successors, (1980), 1406 states have internal predecessors, (1980), 179 states have call successors, (179), 112 states have call predecessors, (179), 126 states have return successors, (211), 173 states have call predecessors, (211), 175 states have call successors, (211) [2025-03-08 07:35:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2370 transitions. [2025-03-08 07:35:58,311 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2370 transitions. Word has length 63 [2025-03-08 07:35:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:58,312 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2370 transitions. [2025-03-08 07:35:58,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 07:35:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2370 transitions. [2025-03-08 07:35:58,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:58,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:58,314 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] [2025-03-08 07:35:58,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:35:58,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:58,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash 990202928, now seen corresponding path program 1 times [2025-03-08 07:35:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323103657] [2025-03-08 07:35:58,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:58,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:58,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:58,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:58,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:58,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:58,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:58,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323103657] [2025-03-08 07:35:58,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323103657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:58,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:58,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:35:58,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508013981] [2025-03-08 07:35:58,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:58,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:35:58,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:58,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:35:58,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:58,401 INFO L87 Difference]: Start difference. First operand 1689 states and 2370 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:35:58,517 INFO L93 Difference]: Finished difference Result 3052 states and 4238 transitions. [2025-03-08 07:35:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:35:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 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 64 [2025-03-08 07:35:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:35:58,532 INFO L225 Difference]: With dead ends: 3052 [2025-03-08 07:35:58,533 INFO L226 Difference]: Without dead ends: 1729 [2025-03-08 07:35:58,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:35:58,539 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 0 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3569 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:35:58,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3569 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:35:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-03-08 07:35:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1729. [2025-03-08 07:35:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1414 states have (on average 1.4186704384724187) internal successors, (2006), 1438 states have internal predecessors, (2006), 179 states have call successors, (179), 112 states have call predecessors, (179), 134 states have return successors, (219), 181 states have call predecessors, (219), 175 states have call successors, (219) [2025-03-08 07:35:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2404 transitions. [2025-03-08 07:35:58,670 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2404 transitions. Word has length 64 [2025-03-08 07:35:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:35:58,671 INFO L471 AbstractCegarLoop]: Abstraction has 1729 states and 2404 transitions. [2025-03-08 07:35:58,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:35:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2404 transitions. [2025-03-08 07:35:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 07:35:58,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:35:58,673 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] [2025-03-08 07:35:58,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:35:58,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:35:58,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:35:58,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1354464113, now seen corresponding path program 1 times [2025-03-08 07:35:58,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:35:58,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437223253] [2025-03-08 07:35:58,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:35:58,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:35:58,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 07:35:58,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 07:35:58,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:35:58,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:35:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:35:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:35:58,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437223253] [2025-03-08 07:35:58,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437223253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:35:58,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:35:58,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:35:58,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119012547] [2025-03-08 07:35:58,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:35:58,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:35:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:35:58,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:35:58,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:35:58,790 INFO L87 Difference]: Start difference. First operand 1729 states and 2404 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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-08 07:36:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:00,105 INFO L93 Difference]: Finished difference Result 4948 states and 6821 transitions. [2025-03-08 07:36:00,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:36:00,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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 64 [2025-03-08 07:36:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:00,117 INFO L225 Difference]: With dead ends: 4948 [2025-03-08 07:36:00,118 INFO L226 Difference]: Without dead ends: 2017 [2025-03-08 07:36:00,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:36:00,129 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 3240 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3258 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:00,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3258 Valid, 2011 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:36:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2025-03-08 07:36:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1947. [2025-03-08 07:36:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1560 states have (on average 1.3711538461538462) internal successors, (2139), 1586 states have internal predecessors, (2139), 219 states have call successors, (219), 140 states have call predecessors, (219), 166 states have return successors, (265), 223 states have call predecessors, (265), 215 states have call successors, (265) [2025-03-08 07:36:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2623 transitions. [2025-03-08 07:36:00,239 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2623 transitions. Word has length 64 [2025-03-08 07:36:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:00,239 INFO L471 AbstractCegarLoop]: Abstraction has 1947 states and 2623 transitions. [2025-03-08 07:36:00,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 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-08 07:36:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2623 transitions. [2025-03-08 07:36:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:00,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:00,242 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:00,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:36:00,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:00,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1512731577, now seen corresponding path program 1 times [2025-03-08 07:36:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:00,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889361211] [2025-03-08 07:36:00,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:00,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:00,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:00,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:00,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:36:00,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:00,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889361211] [2025-03-08 07:36:00,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889361211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:00,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:00,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:00,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050609875] [2025-03-08 07:36:00,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:00,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:00,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:00,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:00,342 INFO L87 Difference]: Start difference. First operand 1947 states and 2623 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:36:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:00,432 INFO L93 Difference]: Finished difference Result 3588 states and 4776 transitions. [2025-03-08 07:36:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:36:00,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 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 86 [2025-03-08 07:36:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:00,443 INFO L225 Difference]: With dead ends: 3588 [2025-03-08 07:36:00,443 INFO L226 Difference]: Without dead ends: 2007 [2025-03-08 07:36:00,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:00,448 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 0 mSDsluCounter, 2823 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3530 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:00,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3530 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2025-03-08 07:36:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 2007. [2025-03-08 07:36:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1608 states have (on average 1.3563432835820894) internal successors, (2181), 1634 states have internal predecessors, (2181), 219 states have call successors, (219), 140 states have call predecessors, (219), 178 states have return successors, (277), 235 states have call predecessors, (277), 215 states have call successors, (277) [2025-03-08 07:36:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2677 transitions. [2025-03-08 07:36:00,545 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2677 transitions. Word has length 86 [2025-03-08 07:36:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:00,545 INFO L471 AbstractCegarLoop]: Abstraction has 2007 states and 2677 transitions. [2025-03-08 07:36:00,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:36:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2677 transitions. [2025-03-08 07:36:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:00,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:00,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:36:00,547 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:00,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash -543150554, now seen corresponding path program 1 times [2025-03-08 07:36:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787917163] [2025-03-08 07:36:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:00,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:00,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:00,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:00,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:36:00,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:00,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787917163] [2025-03-08 07:36:00,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787917163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:00,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:00,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:00,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917102245] [2025-03-08 07:36:00,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:00,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:00,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:00,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:00,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:00,659 INFO L87 Difference]: Start difference. First operand 2007 states and 2677 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:01,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:01,462 INFO L93 Difference]: Finished difference Result 3413 states and 4474 transitions. [2025-03-08 07:36:01,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:36:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 86 [2025-03-08 07:36:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:01,471 INFO L225 Difference]: With dead ends: 3413 [2025-03-08 07:36:01,471 INFO L226 Difference]: Without dead ends: 2003 [2025-03-08 07:36:01,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:01,475 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 1040 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:01,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1557 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2025-03-08 07:36:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1793. [2025-03-08 07:36:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1447 states have (on average 1.3614374568071872) internal successors, (1970), 1468 states have internal predecessors, (1970), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2025-03-08 07:36:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2398 transitions. [2025-03-08 07:36:01,591 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2398 transitions. Word has length 86 [2025-03-08 07:36:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:01,591 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2398 transitions. [2025-03-08 07:36:01,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 07:36:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2398 transitions. [2025-03-08 07:36:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:01,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:01,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:01,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:36:01,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:01,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash -991847193, now seen corresponding path program 1 times [2025-03-08 07:36:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:01,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087900018] [2025-03-08 07:36:01,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:01,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:01,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:01,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:01,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:01,676 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-08 07:36:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:01,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087900018] [2025-03-08 07:36:01,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087900018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:01,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:01,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:36:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283181760] [2025-03-08 07:36:01,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:01,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:36:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:01,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:36:01,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:36:01,679 INFO L87 Difference]: Start difference. First operand 1793 states and 2398 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:36:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:02,188 INFO L93 Difference]: Finished difference Result 4645 states and 6128 transitions. [2025-03-08 07:36:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:36:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 86 [2025-03-08 07:36:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:02,202 INFO L225 Difference]: With dead ends: 4645 [2025-03-08 07:36:02,202 INFO L226 Difference]: Without dead ends: 3219 [2025-03-08 07:36:02,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:02,206 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 971 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:02,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 786 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:36:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2025-03-08 07:36:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 3219. [2025-03-08 07:36:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2553 states have (on average 1.3141402271837055) internal successors, (3355), 2603 states have internal predecessors, (3355), 352 states have call successors, (352), 234 states have call predecessors, (352), 312 states have return successors, (520), 384 states have call predecessors, (520), 348 states have call successors, (520) [2025-03-08 07:36:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4227 transitions. [2025-03-08 07:36:02,337 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4227 transitions. Word has length 86 [2025-03-08 07:36:02,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:02,338 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4227 transitions. [2025-03-08 07:36:02,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 07:36:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4227 transitions. [2025-03-08 07:36:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 07:36:02,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:02,343 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:02,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:36:02,343 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:02,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:02,344 INFO L85 PathProgramCache]: Analyzing trace with hash 116968006, now seen corresponding path program 1 times [2025-03-08 07:36:02,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:02,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415917810] [2025-03-08 07:36:02,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:02,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:02,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 07:36:02,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 07:36:02,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:02,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:36:02,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:02,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415917810] [2025-03-08 07:36:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415917810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:02,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:02,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:36:02,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007059315] [2025-03-08 07:36:02,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:02,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:36:02,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:02,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:36:02,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:36:02,378 INFO L87 Difference]: Start difference. First operand 3219 states and 4227 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 07:36:02,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:02,469 INFO L93 Difference]: Finished difference Result 4645 states and 6008 transitions. [2025-03-08 07:36:02,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:36:02,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 86 [2025-03-08 07:36:02,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:02,478 INFO L225 Difference]: With dead ends: 4645 [2025-03-08 07:36:02,478 INFO L226 Difference]: Without dead ends: 1793 [2025-03-08 07:36:02,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:36:02,485 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 137 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:02,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1270 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-03-08 07:36:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1793. [2025-03-08 07:36:02,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1447 states have (on average 1.3358673116793365) internal successors, (1933), 1468 states have internal predecessors, (1933), 191 states have call successors, (191), 121 states have call predecessors, (191), 153 states have return successors, (237), 205 states have call predecessors, (237), 187 states have call successors, (237) [2025-03-08 07:36:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2361 transitions. [2025-03-08 07:36:02,563 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2361 transitions. Word has length 86 [2025-03-08 07:36:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:02,563 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2361 transitions. [2025-03-08 07:36:02,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 07:36:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2361 transitions. [2025-03-08 07:36:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 07:36:02,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:02,565 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, 1, 1] [2025-03-08 07:36:02,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:36:02,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:02,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:02,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1562445988, now seen corresponding path program 1 times [2025-03-08 07:36:02,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:02,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714622999] [2025-03-08 07:36:02,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:02,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:02,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 07:36:02,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 07:36:02,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:02,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:36:02,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:02,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714622999] [2025-03-08 07:36:02,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714622999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:02,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:02,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 07:36:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850045071] [2025-03-08 07:36:02,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 07:36:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:02,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 07:36:02,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 07:36:02,651 INFO L87 Difference]: Start difference. First operand 1793 states and 2361 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:36:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:03,725 INFO L93 Difference]: Finished difference Result 4078 states and 5278 transitions. [2025-03-08 07:36:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 07:36:03,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 87 [2025-03-08 07:36:03,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:03,739 INFO L225 Difference]: With dead ends: 4078 [2025-03-08 07:36:03,740 INFO L226 Difference]: Without dead ends: 2505 [2025-03-08 07:36:03,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-03-08 07:36:03,745 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 1681 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:03,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 2059 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 07:36:03,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2025-03-08 07:36:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2384. [2025-03-08 07:36:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2384 states, 1892 states have (on average 1.2959830866807611) internal successors, (2452), 1922 states have internal predecessors, (2452), 262 states have call successors, (262), 171 states have call predecessors, (262), 228 states have return successors, (342), 292 states have call predecessors, (342), 258 states have call successors, (342) [2025-03-08 07:36:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 3056 transitions. [2025-03-08 07:36:03,880 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 3056 transitions. Word has length 87 [2025-03-08 07:36:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:03,880 INFO L471 AbstractCegarLoop]: Abstraction has 2384 states and 3056 transitions. [2025-03-08 07:36:03,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 07:36:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 3056 transitions. [2025-03-08 07:36:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 07:36:03,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:03,883 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 07:36:03,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:36:03,883 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:03,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:03,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1373443810, now seen corresponding path program 1 times [2025-03-08 07:36:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786462687] [2025-03-08 07:36:03,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:03,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 07:36:03,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 07:36:03,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:03,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 07:36:04,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786462687] [2025-03-08 07:36:04,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786462687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:36:04,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856691523] [2025-03-08 07:36:04,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:04,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:36:04,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:36:04,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:36:04,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:36:04,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 07:36:04,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 07:36:04,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:04,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:04,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:36:04,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:36:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 07:36:04,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:36:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856691523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:36:04,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 07:36:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277418608] [2025-03-08 07:36:04,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:04,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:36:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:04,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:36:04,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:04,368 INFO L87 Difference]: Start difference. First operand 2384 states and 3056 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:36:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:04,571 INFO L93 Difference]: Finished difference Result 6197 states and 7737 transitions. [2025-03-08 07:36:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:36:04,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 156 [2025-03-08 07:36:04,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:04,590 INFO L225 Difference]: With dead ends: 6197 [2025-03-08 07:36:04,590 INFO L226 Difference]: Without dead ends: 4253 [2025-03-08 07:36:04,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:36:04,596 INFO L435 NwaCegarLoop]: 709 mSDtfsCounter, 61 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:04,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1394 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:36:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2025-03-08 07:36:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 4221. [2025-03-08 07:36:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4221 states, 3312 states have (on average 1.2599637681159421) internal successors, (4173), 3367 states have internal predecessors, (4173), 469 states have call successors, (469), 334 states have call predecessors, (469), 438 states have return successors, (605), 521 states have call predecessors, (605), 465 states have call successors, (605) [2025-03-08 07:36:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4221 states to 4221 states and 5247 transitions. [2025-03-08 07:36:04,807 INFO L78 Accepts]: Start accepts. Automaton has 4221 states and 5247 transitions. Word has length 156 [2025-03-08 07:36:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:04,808 INFO L471 AbstractCegarLoop]: Abstraction has 4221 states and 5247 transitions. [2025-03-08 07:36:04,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 07:36:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4221 states and 5247 transitions. [2025-03-08 07:36:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:04,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:04,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:04,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 07:36:05,016 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,SelfDestructingSolverStorable10 [2025-03-08 07:36:05,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:05,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash -369873322, now seen corresponding path program 1 times [2025-03-08 07:36:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:05,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454789143] [2025-03-08 07:36:05,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:05,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:05,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:05,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:05,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:05,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:05,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:05,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:05,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454789143] [2025-03-08 07:36:05,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454789143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:05,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:05,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:05,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984277964] [2025-03-08 07:36:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:05,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:05,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:05,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:05,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:05,118 INFO L87 Difference]: Start difference. First operand 4221 states and 5247 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:05,827 INFO L93 Difference]: Finished difference Result 4941 states and 6399 transitions. [2025-03-08 07:36:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:36:05,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:05,847 INFO L225 Difference]: With dead ends: 4941 [2025-03-08 07:36:05,850 INFO L226 Difference]: Without dead ends: 4603 [2025-03-08 07:36:05,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:05,854 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1259 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:05,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1884 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:36:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4603 states. [2025-03-08 07:36:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4603 to 4574. [2025-03-08 07:36:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4574 states, 3638 states have (on average 1.2908191313908741) internal successors, (4696), 3694 states have internal predecessors, (4696), 489 states have call successors, (489), 340 states have call predecessors, (489), 445 states have return successors, (626), 541 states have call predecessors, (626), 485 states have call successors, (626) [2025-03-08 07:36:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 5811 transitions. [2025-03-08 07:36:06,076 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 5811 transitions. Word has length 166 [2025-03-08 07:36:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:06,076 INFO L471 AbstractCegarLoop]: Abstraction has 4574 states and 5811 transitions. [2025-03-08 07:36:06,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 5811 transitions. [2025-03-08 07:36:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:06,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:06,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:06,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:36:06,079 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:06,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:06,080 INFO L85 PathProgramCache]: Analyzing trace with hash -76656300, now seen corresponding path program 1 times [2025-03-08 07:36:06,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:06,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656788244] [2025-03-08 07:36:06,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:06,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:06,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:06,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:06,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:06,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656788244] [2025-03-08 07:36:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656788244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:06,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761023671] [2025-03-08 07:36:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:06,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:06,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:06,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:06,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:06,220 INFO L87 Difference]: Start difference. First operand 4574 states and 5811 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:07,341 INFO L93 Difference]: Finished difference Result 5718 states and 7660 transitions. [2025-03-08 07:36:07,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:07,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:07,364 INFO L225 Difference]: With dead ends: 5718 [2025-03-08 07:36:07,364 INFO L226 Difference]: Without dead ends: 5027 [2025-03-08 07:36:07,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:07,369 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 1266 mSDsluCounter, 2441 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:07,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 3254 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:36:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2025-03-08 07:36:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4902. [2025-03-08 07:36:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4902 states, 3939 states have (on average 1.3122619954303123) internal successors, (5169), 3996 states have internal predecessors, (5169), 509 states have call successors, (509), 346 states have call predecessors, (509), 452 states have return successors, (649), 562 states have call predecessors, (649), 505 states have call successors, (649) [2025-03-08 07:36:07,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4902 states to 4902 states and 6327 transitions. [2025-03-08 07:36:07,656 INFO L78 Accepts]: Start accepts. Automaton has 4902 states and 6327 transitions. Word has length 166 [2025-03-08 07:36:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:07,656 INFO L471 AbstractCegarLoop]: Abstraction has 4902 states and 6327 transitions. [2025-03-08 07:36:07,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4902 states and 6327 transitions. [2025-03-08 07:36:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:07,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:07,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:07,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:36:07,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:07,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2010862699, now seen corresponding path program 1 times [2025-03-08 07:36:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:07,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189011695] [2025-03-08 07:36:07,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:07,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:07,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:07,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:07,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189011695] [2025-03-08 07:36:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189011695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:07,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:07,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:07,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452371530] [2025-03-08 07:36:07,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:07,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:07,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:07,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:07,790 INFO L87 Difference]: Start difference. First operand 4902 states and 6327 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:08,823 INFO L93 Difference]: Finished difference Result 6766 states and 9335 transitions. [2025-03-08 07:36:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:08,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:08,841 INFO L225 Difference]: With dead ends: 6766 [2025-03-08 07:36:08,841 INFO L226 Difference]: Without dead ends: 5747 [2025-03-08 07:36:08,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:08,845 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 1261 mSDsluCounter, 2429 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 3238 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:08,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 3238 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 07:36:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5747 states. [2025-03-08 07:36:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5747 to 5603. [2025-03-08 07:36:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5603 states, 4584 states have (on average 1.3520942408376964) internal successors, (6198), 4645 states have internal predecessors, (6198), 549 states have call successors, (549), 358 states have call predecessors, (549), 468 states have return successors, (701), 604 states have call predecessors, (701), 545 states have call successors, (701) [2025-03-08 07:36:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5603 states to 5603 states and 7448 transitions. [2025-03-08 07:36:09,116 INFO L78 Accepts]: Start accepts. Automaton has 5603 states and 7448 transitions. Word has length 166 [2025-03-08 07:36:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:09,116 INFO L471 AbstractCegarLoop]: Abstraction has 5603 states and 7448 transitions. [2025-03-08 07:36:09,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 5603 states and 7448 transitions. [2025-03-08 07:36:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:09,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:09,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:09,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:36:09,119 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:09,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash -133593804, now seen corresponding path program 1 times [2025-03-08 07:36:09,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:09,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765350164] [2025-03-08 07:36:09,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:09,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:09,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:09,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:09,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:09,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:09,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765350164] [2025-03-08 07:36:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765350164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913215701] [2025-03-08 07:36:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:09,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:09,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:09,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:09,241 INFO L87 Difference]: Start difference. First operand 5603 states and 7448 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:10,347 INFO L93 Difference]: Finished difference Result 9037 states and 13038 transitions. [2025-03-08 07:36:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:10,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:10,388 INFO L225 Difference]: With dead ends: 9037 [2025-03-08 07:36:10,388 INFO L226 Difference]: Without dead ends: 7317 [2025-03-08 07:36:10,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:10,399 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 1256 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 3226 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:10,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 3226 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7317 states. [2025-03-08 07:36:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7317 to 7134. [2025-03-08 07:36:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7134 states, 5997 states have (on average 1.4163748540937136) internal successors, (8494), 6072 states have internal predecessors, (8494), 629 states have call successors, (629), 382 states have call predecessors, (629), 506 states have return successors, (829), 688 states have call predecessors, (829), 625 states have call successors, (829) [2025-03-08 07:36:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 9952 transitions. [2025-03-08 07:36:10,822 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 9952 transitions. Word has length 166 [2025-03-08 07:36:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:10,823 INFO L471 AbstractCegarLoop]: Abstraction has 7134 states and 9952 transitions. [2025-03-08 07:36:10,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:10,823 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 9952 transitions. [2025-03-08 07:36:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:10,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:10,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:10,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:36:10,826 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:10,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -211584075, now seen corresponding path program 1 times [2025-03-08 07:36:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469848985] [2025-03-08 07:36:10,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:10,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:10,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:10,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:10,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:10,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:10,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469848985] [2025-03-08 07:36:10,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469848985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:10,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:10,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362110107] [2025-03-08 07:36:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:10,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:10,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:10,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:10,930 INFO L87 Difference]: Start difference. First operand 7134 states and 9952 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:12,038 INFO L93 Difference]: Finished difference Result 14076 states and 21480 transitions. [2025-03-08 07:36:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:12,080 INFO L225 Difference]: With dead ends: 14076 [2025-03-08 07:36:12,080 INFO L226 Difference]: Without dead ends: 10825 [2025-03-08 07:36:12,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:12,093 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 1251 mSDsluCounter, 2411 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 3214 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:12,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 3214 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10825 states. [2025-03-08 07:36:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10825 to 10565. [2025-03-08 07:36:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10565 states, 9174 states have (on average 1.50054501853063) internal successors, (13766), 9295 states have internal predecessors, (13766), 789 states have call successors, (789), 430 states have call predecessors, (789), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-08 07:36:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10565 states to 10565 states and 15736 transitions. [2025-03-08 07:36:12,649 INFO L78 Accepts]: Start accepts. Automaton has 10565 states and 15736 transitions. Word has length 166 [2025-03-08 07:36:12,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:12,649 INFO L471 AbstractCegarLoop]: Abstraction has 10565 states and 15736 transitions. [2025-03-08 07:36:12,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 10565 states and 15736 transitions. [2025-03-08 07:36:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:12,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:12,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:12,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:36:12,656 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:12,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:12,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2141204756, now seen corresponding path program 1 times [2025-03-08 07:36:12,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:12,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86122470] [2025-03-08 07:36:12,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:12,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:12,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:12,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:12,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:12,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:12,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:12,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86122470] [2025-03-08 07:36:12,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86122470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:12,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:12,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:12,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677150766] [2025-03-08 07:36:12,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:12,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:12,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:12,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:12,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:12,784 INFO L87 Difference]: Start difference. First operand 10565 states and 15736 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:13,663 INFO L93 Difference]: Finished difference Result 18907 states and 30119 transitions. [2025-03-08 07:36:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:13,702 INFO L225 Difference]: With dead ends: 18907 [2025-03-08 07:36:13,702 INFO L226 Difference]: Without dead ends: 12225 [2025-03-08 07:36:13,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:13,720 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 942 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:13,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1296 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:36:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12225 states. [2025-03-08 07:36:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12225 to 10565. [2025-03-08 07:36:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10565 states, 9174 states have (on average 1.498691955526488) internal successors, (13749), 9295 states have internal predecessors, (13749), 789 states have call successors, (789), 430 states have call predecessors, (789), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-08 07:36:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10565 states to 10565 states and 15719 transitions. [2025-03-08 07:36:14,479 INFO L78 Accepts]: Start accepts. Automaton has 10565 states and 15719 transitions. Word has length 166 [2025-03-08 07:36:14,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:14,480 INFO L471 AbstractCegarLoop]: Abstraction has 10565 states and 15719 transitions. [2025-03-08 07:36:14,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 10565 states and 15719 transitions. [2025-03-08 07:36:14,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:14,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:14,485 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:14,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:36:14,486 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:14,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1247269845, now seen corresponding path program 1 times [2025-03-08 07:36:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:14,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241394012] [2025-03-08 07:36:14,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:14,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:14,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:14,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:14,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:14,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:14,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241394012] [2025-03-08 07:36:14,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241394012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:14,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:14,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:14,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314838798] [2025-03-08 07:36:14,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:14,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:14,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:14,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:14,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:14,577 INFO L87 Difference]: Start difference. First operand 10565 states and 15719 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:15,293 INFO L93 Difference]: Finished difference Result 18824 states and 29919 transitions. [2025-03-08 07:36:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:15,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:15,330 INFO L225 Difference]: With dead ends: 18824 [2025-03-08 07:36:15,330 INFO L226 Difference]: Without dead ends: 12142 [2025-03-08 07:36:15,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:15,348 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 939 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:15,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1288 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:36:15,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12142 states. [2025-03-08 07:36:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12142 to 10565. [2025-03-08 07:36:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10565 states, 9174 states have (on average 1.4968388925223457) internal successors, (13732), 9295 states have internal predecessors, (13732), 789 states have call successors, (789), 430 states have call predecessors, (789), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-08 07:36:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10565 states to 10565 states and 15702 transitions. [2025-03-08 07:36:15,883 INFO L78 Accepts]: Start accepts. Automaton has 10565 states and 15702 transitions. Word has length 166 [2025-03-08 07:36:15,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:15,884 INFO L471 AbstractCegarLoop]: Abstraction has 10565 states and 15702 transitions. [2025-03-08 07:36:15,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:15,885 INFO L276 IsEmpty]: Start isEmpty. Operand 10565 states and 15702 transitions. [2025-03-08 07:36:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:15,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:15,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:15,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:36:15,890 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:15,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1968155404, now seen corresponding path program 1 times [2025-03-08 07:36:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807207331] [2025-03-08 07:36:15,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:15,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:15,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:15,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:15,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:15,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:15,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807207331] [2025-03-08 07:36:15,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807207331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:15,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:15,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:15,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068364220] [2025-03-08 07:36:15,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:15,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:15,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:15,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:15,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:15,964 INFO L87 Difference]: Start difference. First operand 10565 states and 15702 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:16,676 INFO L93 Difference]: Finished difference Result 18741 states and 29719 transitions. [2025-03-08 07:36:16,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:16,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:16,724 INFO L225 Difference]: With dead ends: 18741 [2025-03-08 07:36:16,724 INFO L226 Difference]: Without dead ends: 12059 [2025-03-08 07:36:16,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:16,740 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 936 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:16,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1280 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 07:36:16,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12059 states. [2025-03-08 07:36:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12059 to 10565. [2025-03-08 07:36:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10565 states, 9174 states have (on average 1.4949858295182037) internal successors, (13715), 9295 states have internal predecessors, (13715), 789 states have call successors, (789), 430 states have call predecessors, (789), 600 states have return successors, (1181), 856 states have call predecessors, (1181), 785 states have call successors, (1181) [2025-03-08 07:36:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10565 states to 10565 states and 15685 transitions. [2025-03-08 07:36:17,238 INFO L78 Accepts]: Start accepts. Automaton has 10565 states and 15685 transitions. Word has length 166 [2025-03-08 07:36:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:17,238 INFO L471 AbstractCegarLoop]: Abstraction has 10565 states and 15685 transitions. [2025-03-08 07:36:17,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 10565 states and 15685 transitions. [2025-03-08 07:36:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:17,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:17,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:17,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:36:17,244 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:17,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:17,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1933331467, now seen corresponding path program 1 times [2025-03-08 07:36:17,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:17,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432434182] [2025-03-08 07:36:17,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:17,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:17,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:17,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:17,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:17,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:17,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:17,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432434182] [2025-03-08 07:36:17,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432434182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:17,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:17,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:17,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156951058] [2025-03-08 07:36:17,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:17,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:17,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:17,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:17,330 INFO L87 Difference]: Start difference. First operand 10565 states and 15685 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:19,212 INFO L93 Difference]: Finished difference Result 25271 states and 40697 transitions. [2025-03-08 07:36:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:19,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:19,292 INFO L225 Difference]: With dead ends: 25271 [2025-03-08 07:36:19,293 INFO L226 Difference]: Without dead ends: 18589 [2025-03-08 07:36:19,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:19,320 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 1222 mSDsluCounter, 2360 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:19,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 3145 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 07:36:19,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18589 states. [2025-03-08 07:36:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18589 to 18237. [2025-03-08 07:36:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18237 states, 16284 states have (on average 1.5758413166298206) internal successors, (25661), 16551 states have internal predecessors, (25661), 1109 states have call successors, (1109), 526 states have call predecessors, (1109), 842 states have return successors, (2269), 1192 states have call predecessors, (2269), 1105 states have call successors, (2269) [2025-03-08 07:36:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18237 states to 18237 states and 29039 transitions. [2025-03-08 07:36:20,157 INFO L78 Accepts]: Start accepts. Automaton has 18237 states and 29039 transitions. Word has length 166 [2025-03-08 07:36:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:20,158 INFO L471 AbstractCegarLoop]: Abstraction has 18237 states and 29039 transitions. [2025-03-08 07:36:20,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 18237 states and 29039 transitions. [2025-03-08 07:36:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:20,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:20,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:20,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:36:20,165 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:20,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash 423096532, now seen corresponding path program 1 times [2025-03-08 07:36:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:20,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144884184] [2025-03-08 07:36:20,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:20,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:20,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:20,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:20,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:20,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:20,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144884184] [2025-03-08 07:36:20,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144884184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:20,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:20,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:36:20,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678228601] [2025-03-08 07:36:20,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:20,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:36:20,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:20,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:36:20,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:36:20,283 INFO L87 Difference]: Start difference. First operand 18237 states and 29039 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:21,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:21,354 INFO L93 Difference]: Finished difference Result 36511 states and 61559 transitions. [2025-03-08 07:36:21,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:36:21,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:21,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:21,421 INFO L225 Difference]: With dead ends: 36511 [2025-03-08 07:36:21,421 INFO L226 Difference]: Without dead ends: 22157 [2025-03-08 07:36:21,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:21,599 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 932 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:21,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 1266 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:36:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22157 states. [2025-03-08 07:36:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22157 to 18237. [2025-03-08 07:36:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18237 states, 16284 states have (on average 1.5738147875214934) internal successors, (25628), 16551 states have internal predecessors, (25628), 1109 states have call successors, (1109), 526 states have call predecessors, (1109), 842 states have return successors, (2269), 1192 states have call predecessors, (2269), 1105 states have call successors, (2269) [2025-03-08 07:36:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18237 states to 18237 states and 29006 transitions. [2025-03-08 07:36:22,372 INFO L78 Accepts]: Start accepts. Automaton has 18237 states and 29006 transitions. Word has length 166 [2025-03-08 07:36:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:22,373 INFO L471 AbstractCegarLoop]: Abstraction has 18237 states and 29006 transitions. [2025-03-08 07:36:22,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 18237 states and 29006 transitions. [2025-03-08 07:36:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:22,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:22,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:22,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 07:36:22,380 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:22,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:22,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1024910315, now seen corresponding path program 1 times [2025-03-08 07:36:22,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:22,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491895050] [2025-03-08 07:36:22,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:22,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:22,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:22,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:22,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:22,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491895050] [2025-03-08 07:36:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491895050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:22,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:22,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:22,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604293515] [2025-03-08 07:36:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:22,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:22,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:22,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:22,477 INFO L87 Difference]: Start difference. First operand 18237 states and 29006 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:24,187 INFO L93 Difference]: Finished difference Result 50757 states and 86634 transitions. [2025-03-08 07:36:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:24,351 INFO L225 Difference]: With dead ends: 50757 [2025-03-08 07:36:24,351 INFO L226 Difference]: Without dead ends: 36403 [2025-03-08 07:36:24,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:24,418 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 1209 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:24,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 3114 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36403 states. [2025-03-08 07:36:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36403 to 35849. [2025-03-08 07:36:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35849 states, 32610 states have (on average 1.641275682306041) internal successors, (53522), 33331 states have internal predecessors, (53522), 1749 states have call successors, (1749), 718 states have call predecessors, (1749), 1488 states have return successors, (5981), 1864 states have call predecessors, (5981), 1745 states have call successors, (5981) [2025-03-08 07:36:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35849 states to 35849 states and 61252 transitions. [2025-03-08 07:36:26,348 INFO L78 Accepts]: Start accepts. Automaton has 35849 states and 61252 transitions. Word has length 166 [2025-03-08 07:36:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:26,348 INFO L471 AbstractCegarLoop]: Abstraction has 35849 states and 61252 transitions. [2025-03-08 07:36:26,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 35849 states and 61252 transitions. [2025-03-08 07:36:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:26,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:26,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:26,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 07:36:26,358 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:26,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash 313853108, now seen corresponding path program 1 times [2025-03-08 07:36:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:26,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480523512] [2025-03-08 07:36:26,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:26,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:26,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:26,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:26,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:26,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:26,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:26,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480523512] [2025-03-08 07:36:26,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480523512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:26,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:26,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531588319] [2025-03-08 07:36:26,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:26,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:26,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:26,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:26,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:26,440 INFO L87 Difference]: Start difference. First operand 35849 states and 61252 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:29,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:29,249 INFO L93 Difference]: Finished difference Result 110567 states and 201974 transitions. [2025-03-08 07:36:29,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:29,665 INFO L225 Difference]: With dead ends: 110567 [2025-03-08 07:36:29,666 INFO L226 Difference]: Without dead ends: 78601 [2025-03-08 07:36:29,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:36:29,767 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 1204 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 3102 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:29,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 3102 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78601 states. [2025-03-08 07:36:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78601 to 77634. [2025-03-08 07:36:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77634 states, 71337 states have (on average 1.6953614533832373) internal successors, (120942), 73452 states have internal predecessors, (120942), 3029 states have call successors, (3029), 1102 states have call predecessors, (3029), 3266 states have return successors, (19549), 3208 states have call predecessors, (19549), 3025 states have call successors, (19549) [2025-03-08 07:36:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77634 states to 77634 states and 143520 transitions. [2025-03-08 07:36:33,926 INFO L78 Accepts]: Start accepts. Automaton has 77634 states and 143520 transitions. Word has length 166 [2025-03-08 07:36:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:36:33,926 INFO L471 AbstractCegarLoop]: Abstraction has 77634 states and 143520 transitions. [2025-03-08 07:36:33,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 77634 states and 143520 transitions. [2025-03-08 07:36:33,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-08 07:36:33,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:36:33,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:36:33,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 07:36:33,942 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:36:33,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:36:33,943 INFO L85 PathProgramCache]: Analyzing trace with hash 495586357, now seen corresponding path program 1 times [2025-03-08 07:36:33,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:36:33,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807945058] [2025-03-08 07:36:33,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:36:33,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:36:33,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 07:36:33,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 07:36:33,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:36:33,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:36:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:36:34,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:36:34,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807945058] [2025-03-08 07:36:34,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807945058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:36:34,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:36:34,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:36:34,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952953954] [2025-03-08 07:36:34,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:36:34,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:36:34,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:36:34,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:36:34,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:36:34,025 INFO L87 Difference]: Start difference. First operand 77634 states and 143520 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:36:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:36:41,338 INFO L93 Difference]: Finished difference Result 265408 states and 523025 transitions. [2025-03-08 07:36:41,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:36:41,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-03-08 07:36:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:36:42,305 INFO L225 Difference]: With dead ends: 265408 [2025-03-08 07:36:42,305 INFO L226 Difference]: Without dead ends: 191657 [2025-03-08 07:36:42,485 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-08 07:36:42,486 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 1543 mSDsluCounter, 2308 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 3077 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:36:42,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1586 Valid, 3077 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 07:36:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191657 states.