./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20da2548babe3ea7ba69c8856235b685b3dad9dcce2cbb8d7159e2037477f2fb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:57:08,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:57:08,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:57:08,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:57:08,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:57:08,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:57:08,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:57:08,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:57:08,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:57:08,598 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:57:08,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:57:08,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:57:08,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:57:08,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:57:08,600 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:57:08,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:57:08,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:57:08,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:57:08,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:57:08,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:57:08,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:57:08,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:57:08,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:57:08,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:57:08,602 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:57:08,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:57:08,602 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:57:08,602 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:57:08,602 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:57:08,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:57:08,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:57:08,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:57:08,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:57:08,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:57:08,603 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20da2548babe3ea7ba69c8856235b685b3dad9dcce2cbb8d7159e2037477f2fb [2025-02-05 17:57:08,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:57:08,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:57:08,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:57:08,909 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:57:08,909 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:57:08,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c [2025-02-05 17:57:10,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fd8b1a40/6e69f97e3a614a6691736d3f37542f10/FLAGf25fc7a9b [2025-02-05 17:57:10,470 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:57:10,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c [2025-02-05 17:57:10,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fd8b1a40/6e69f97e3a614a6691736d3f37542f10/FLAGf25fc7a9b [2025-02-05 17:57:10,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fd8b1a40/6e69f97e3a614a6691736d3f37542f10 [2025-02-05 17:57:10,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:57:10,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:57:10,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:57:10,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:57:10,513 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:57:10,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:57:10" (1/1) ... [2025-02-05 17:57:10,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e55da85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:10, skipping insertion in model container [2025-02-05 17:57:10,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:57:10" (1/1) ... [2025-02-05 17:57:10,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:57:10,691 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c[911,924] [2025-02-05 17:57:10,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c[8416,8429] [2025-02-05 17:57:10,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:57:10,898 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:57:10,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c[911,924] [2025-02-05 17:57:10,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-2.c[8416,8429] [2025-02-05 17:57:10,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:57:11,026 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:57:11,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11 WrapperNode [2025-02-05 17:57:11,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:57:11,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:57:11,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:57:11,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:57:11,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,113 INFO L138 Inliner]: procedures = 73, calls = 89, calls flagged for inlining = 41, calls inlined = 41, statements flattened = 884 [2025-02-05 17:57:11,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:57:11,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:57:11,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:57:11,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:57:11,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,130 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,137 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,171 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:57:11,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,188 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:57:11,205 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:57:11,205 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:57:11,205 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:57:11,206 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (1/1) ... [2025-02-05 17:57:11,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:57:11,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:57:11,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:57:11,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:57:11,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:57:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:57:11,265 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:57:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:57:11,265 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:57:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:57:11,265 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:57:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:57:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:57:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:57:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:57:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:57:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:57:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:57:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:57:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:57:11,267 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:57:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:57:11,267 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:57:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:57:11,267 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:57:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:57:11,267 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:57:11,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:57:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:57:11,268 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:57:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:57:11,268 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:57:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:57:11,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:57:11,269 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:57:11,269 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:57:11,270 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:57:11,271 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:57:11,408 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:57:11,411 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:57:12,181 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: do_read_c_~a~0#1 := ~a_t~0; [2025-02-05 17:57:12,182 INFO L1309 $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-02-05 17:57:12,182 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L226: assume !(1 == ~q_free~0); [2025-02-05 17:57:12,350 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-02-05 17:57:12,350 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:57:12,374 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:57:12,375 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:57:12,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:57:12 BoogieIcfgContainer [2025-02-05 17:57:12,375 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:57:12,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:57:12,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:57:12,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:57:12,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:57:10" (1/3) ... [2025-02-05 17:57:12,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b34794d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:57:12, skipping insertion in model container [2025-02-05 17:57:12,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:57:11" (2/3) ... [2025-02-05 17:57:12,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b34794d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:57:12, skipping insertion in model container [2025-02-05 17:57:12,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:57:12" (3/3) ... [2025-02-05 17:57:12,384 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.09.cil-2.c [2025-02-05 17:57:12,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:57:12,402 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.09.cil-2.c that has 16 procedures, 454 locations, 1 initial locations, 16 loop locations, and 2 error locations. [2025-02-05 17:57:12,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:57:12,479 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;@254f184a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:57:12,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:57:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 455 states, 395 states have (on average 1.5544303797468355) internal successors, (614), 404 states have internal predecessors, (614), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-02-05 17:57:12,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:57:12,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:12,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:12,492 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:12,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash -546961381, now seen corresponding path program 1 times [2025-02-05 17:57:12,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:12,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086124347] [2025-02-05 17:57:12,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:12,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:12,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:57:12,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:57:12,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:12,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:12,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:12,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086124347] [2025-02-05 17:57:12,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086124347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:12,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:12,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:12,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256713323] [2025-02-05 17:57:13,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:13,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:13,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:13,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:13,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:13,029 INFO L87 Difference]: Start difference. First operand has 455 states, 395 states have (on average 1.5544303797468355) internal successors, (614), 404 states have internal predecessors, (614), 41 states have call successors, (41), 15 states have call predecessors, (41), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:14,037 INFO L93 Difference]: Finished difference Result 1006 states and 1535 transitions. [2025-02-05 17:57:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:14,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:57:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:14,060 INFO L225 Difference]: With dead ends: 1006 [2025-02-05 17:57:14,060 INFO L226 Difference]: Without dead ends: 564 [2025-02-05 17:57:14,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:14,070 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 463 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:14,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1487 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:57:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-02-05 17:57:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 557. [2025-02-05 17:57:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 479 states have (on average 1.488517745302714) internal successors, (713), 486 states have internal predecessors, (713), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2025-02-05 17:57:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 822 transitions. [2025-02-05 17:57:14,161 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 822 transitions. Word has length 65 [2025-02-05 17:57:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:14,161 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 822 transitions. [2025-02-05 17:57:14,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 822 transitions. [2025-02-05 17:57:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:57:14,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:14,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:14,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:57:14,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:14,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1855000709, now seen corresponding path program 1 times [2025-02-05 17:57:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979792429] [2025-02-05 17:57:14,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:14,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:57:14,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:57:14,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:14,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:14,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:14,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979792429] [2025-02-05 17:57:14,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979792429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:14,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:14,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:14,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773190686] [2025-02-05 17:57:14,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:14,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:14,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:14,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:14,374 INFO L87 Difference]: Start difference. First operand 557 states and 822 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:15,370 INFO L93 Difference]: Finished difference Result 930 states and 1340 transitions. [2025-02-05 17:57:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:15,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:57:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:15,378 INFO L225 Difference]: With dead ends: 930 [2025-02-05 17:57:15,378 INFO L226 Difference]: Without dead ends: 717 [2025-02-05 17:57:15,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:15,380 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 946 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:15,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 1759 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:57:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-02-05 17:57:15,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 671. [2025-02-05 17:57:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 571 states have (on average 1.4711033274956218) internal successors, (840), 580 states have internal predecessors, (840), 67 states have call successors, (67), 29 states have call predecessors, (67), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2025-02-05 17:57:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 983 transitions. [2025-02-05 17:57:15,439 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 983 transitions. Word has length 65 [2025-02-05 17:57:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:15,440 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 983 transitions. [2025-02-05 17:57:15,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 983 transitions. [2025-02-05 17:57:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:57:15,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:15,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:15,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:57:15,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:15,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash -721810116, now seen corresponding path program 1 times [2025-02-05 17:57:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612129768] [2025-02-05 17:57:15,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:15,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:57:15,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:57:15,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:15,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:15,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612129768] [2025-02-05 17:57:15,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612129768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:15,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:15,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:57:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014299812] [2025-02-05 17:57:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:15,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:57:15,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:15,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:57:15,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:15,589 INFO L87 Difference]: Start difference. First operand 671 states and 983 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-02-05 17:57:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:16,961 INFO L93 Difference]: Finished difference Result 2115 states and 3020 transitions. [2025-02-05 17:57:16,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:57:16,962 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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 65 [2025-02-05 17:57:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:16,971 INFO L225 Difference]: With dead ends: 2115 [2025-02-05 17:57:16,971 INFO L226 Difference]: Without dead ends: 1776 [2025-02-05 17:57:16,974 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-02-05 17:57:16,974 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 2992 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3010 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:16,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3010 Valid, 1966 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 17:57:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2025-02-05 17:57:17,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1729. [2025-02-05 17:57:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1424 states have (on average 1.3946629213483146) internal successors, (1986), 1448 states have internal predecessors, (1986), 177 states have call successors, (177), 112 states have call predecessors, (177), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2025-02-05 17:57:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2372 transitions. [2025-02-05 17:57:17,132 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2372 transitions. Word has length 65 [2025-02-05 17:57:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:17,132 INFO L471 AbstractCegarLoop]: Abstraction has 1729 states and 2372 transitions. [2025-02-05 17:57:17,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 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-02-05 17:57:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2372 transitions. [2025-02-05 17:57:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:57:17,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:17,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:17,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:57:17,135 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:17,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1843635730, now seen corresponding path program 1 times [2025-02-05 17:57:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527258138] [2025-02-05 17:57:17,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:17,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:57:17,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:57:17,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:17,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:17,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:17,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527258138] [2025-02-05 17:57:17,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527258138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:17,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:17,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044881897] [2025-02-05 17:57:17,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:17,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:17,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:17,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:17,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:17,242 INFO L87 Difference]: Start difference. First operand 1729 states and 2372 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:57:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:17,366 INFO L93 Difference]: Finished difference Result 3160 states and 4302 transitions. [2025-02-05 17:57:17,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:17,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-02-05 17:57:17,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:17,379 INFO L225 Difference]: With dead ends: 3160 [2025-02-05 17:57:17,380 INFO L226 Difference]: Without dead ends: 1769 [2025-02-05 17:57:17,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:17,383 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 0 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3294 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-02-05 17:57:17,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3294 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2025-02-05 17:57:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2025-02-05 17:57:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1456 states have (on average 1.3818681318681318) internal successors, (2012), 1480 states have internal predecessors, (2012), 177 states have call successors, (177), 112 states have call predecessors, (177), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2025-02-05 17:57:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2406 transitions. [2025-02-05 17:57:17,499 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2406 transitions. Word has length 66 [2025-02-05 17:57:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:17,500 INFO L471 AbstractCegarLoop]: Abstraction has 1769 states and 2406 transitions. [2025-02-05 17:57:17,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:57:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2406 transitions. [2025-02-05 17:57:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:57:17,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:17,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:17,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:57:17,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:17,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash -818527567, now seen corresponding path program 1 times [2025-02-05 17:57:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:17,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155904688] [2025-02-05 17:57:17,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:17,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:17,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:57:17,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:57:17,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:17,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:17,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:17,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155904688] [2025-02-05 17:57:17,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155904688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:17,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:17,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:57:17,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255819336] [2025-02-05 17:57:17,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:17,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:57:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:17,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:57:17,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:17,654 INFO L87 Difference]: Start difference. First operand 1769 states and 2406 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:57:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:19,101 INFO L93 Difference]: Finished difference Result 5041 states and 6789 transitions. [2025-02-05 17:57:19,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:57:19,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2025-02-05 17:57:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:19,116 INFO L225 Difference]: With dead ends: 5041 [2025-02-05 17:57:19,117 INFO L226 Difference]: Without dead ends: 1973 [2025-02-05 17:57:19,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-02-05 17:57:19,130 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 3008 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3026 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:19,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3026 Valid, 2008 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 17:57:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2025-02-05 17:57:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1914. [2025-02-05 17:57:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1538 states have (on average 1.3381014304291288) internal successors, (2058), 1564 states have internal predecessors, (2058), 211 states have call successors, (211), 134 states have call predecessors, (211), 163 states have return successors, (252), 218 states have call predecessors, (252), 207 states have call successors, (252) [2025-02-05 17:57:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2521 transitions. [2025-02-05 17:57:19,267 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2521 transitions. Word has length 66 [2025-02-05 17:57:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:19,268 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2521 transitions. [2025-02-05 17:57:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:57:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2521 transitions. [2025-02-05 17:57:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:19,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:19,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-02-05 17:57:19,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:57:19,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:19,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1698555728, now seen corresponding path program 1 times [2025-02-05 17:57:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:19,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070298203] [2025-02-05 17:57:19,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:19,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:19,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:19,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:19,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 17:57:19,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:19,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070298203] [2025-02-05 17:57:19,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070298203] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:19,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:19,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:19,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207177401] [2025-02-05 17:57:19,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:19,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:19,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:19,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:19,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:19,364 INFO L87 Difference]: Start difference. First operand 1914 states and 2521 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:57:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:19,478 INFO L93 Difference]: Finished difference Result 3550 states and 4632 transitions. [2025-02-05 17:57:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:19,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 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 108 [2025-02-05 17:57:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:19,490 INFO L225 Difference]: With dead ends: 3550 [2025-02-05 17:57:19,490 INFO L226 Difference]: Without dead ends: 1974 [2025-02-05 17:57:19,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:19,495 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 0 mSDsluCounter, 2595 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:19,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3245 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-02-05 17:57:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2025-02-05 17:57:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1586 states have (on average 1.3240857503152585) internal successors, (2100), 1612 states have internal predecessors, (2100), 211 states have call successors, (211), 134 states have call predecessors, (211), 175 states have return successors, (264), 230 states have call predecessors, (264), 207 states have call successors, (264) [2025-02-05 17:57:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 2575 transitions. [2025-02-05 17:57:19,598 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 2575 transitions. Word has length 108 [2025-02-05 17:57:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:19,599 INFO L471 AbstractCegarLoop]: Abstraction has 1974 states and 2575 transitions. [2025-02-05 17:57:19,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:57:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2575 transitions. [2025-02-05 17:57:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:19,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:19,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-02-05 17:57:19,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:57:19,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:19,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:19,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1642182673, now seen corresponding path program 1 times [2025-02-05 17:57:19,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:19,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962410581] [2025-02-05 17:57:19,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:19,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:19,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:19,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:19,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 17:57:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:19,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962410581] [2025-02-05 17:57:19,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962410581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:19,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:19,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399719239] [2025-02-05 17:57:19,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:19,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:19,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:19,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:19,801 INFO L87 Difference]: Start difference. First operand 1974 states and 2575 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:20,734 INFO L93 Difference]: Finished difference Result 3359 states and 4315 transitions. [2025-02-05 17:57:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:57:20,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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 108 [2025-02-05 17:57:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:20,748 INFO L225 Difference]: With dead ends: 3359 [2025-02-05 17:57:20,748 INFO L226 Difference]: Without dead ends: 1962 [2025-02-05 17:57:20,752 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-02-05 17:57:20,753 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 949 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:20,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1506 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:57:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-02-05 17:57:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1752. [2025-02-05 17:57:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1417 states have (on average 1.3281580804516584) internal successors, (1882), 1438 states have internal predecessors, (1882), 183 states have call successors, (183), 115 states have call predecessors, (183), 150 states have return successors, (224), 200 states have call predecessors, (224), 179 states have call successors, (224) [2025-02-05 17:57:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2289 transitions. [2025-02-05 17:57:20,896 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2289 transitions. Word has length 108 [2025-02-05 17:57:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:20,897 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2289 transitions. [2025-02-05 17:57:20,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:20,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2289 transitions. [2025-02-05 17:57:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:20,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:20,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-02-05 17:57:20,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:57:20,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:20,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:20,901 INFO L85 PathProgramCache]: Analyzing trace with hash -337788944, now seen corresponding path program 1 times [2025-02-05 17:57:20,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:20,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169725374] [2025-02-05 17:57:20,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:20,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:20,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:20,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:20,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:20,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 17:57:20,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:20,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169725374] [2025-02-05 17:57:20,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169725374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:20,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:20,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:57:20,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705198995] [2025-02-05 17:57:20,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:57:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:20,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:57:20,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:57:20,992 INFO L87 Difference]: Start difference. First operand 1752 states and 2289 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-02-05 17:57:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:21,569 INFO L93 Difference]: Finished difference Result 4581 states and 5921 transitions. [2025-02-05 17:57:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:57:21,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 108 [2025-02-05 17:57:21,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:21,591 INFO L225 Difference]: With dead ends: 4581 [2025-02-05 17:57:21,591 INFO L226 Difference]: Without dead ends: 3168 [2025-02-05 17:57:21,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:21,597 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 872 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:21,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 759 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:57:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3168 states. [2025-02-05 17:57:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3168 to 3168. [2025-02-05 17:57:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3168 states, 2522 states have (on average 1.287470261697066) internal successors, (3247), 2572 states have internal predecessors, (3247), 338 states have call successors, (338), 222 states have call predecessors, (338), 306 states have return successors, (493), 376 states have call predecessors, (493), 334 states have call successors, (493) [2025-02-05 17:57:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4078 transitions. [2025-02-05 17:57:21,802 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4078 transitions. Word has length 108 [2025-02-05 17:57:21,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:21,802 INFO L471 AbstractCegarLoop]: Abstraction has 3168 states and 4078 transitions. [2025-02-05 17:57:21,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-02-05 17:57:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4078 transitions. [2025-02-05 17:57:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 17:57:21,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:21,806 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2025-02-05 17:57:21,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:57:21,806 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:21,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1290990577, now seen corresponding path program 1 times [2025-02-05 17:57:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:21,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939070374] [2025-02-05 17:57:21,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:21,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:21,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 17:57:21,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 17:57:21,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:21,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 17:57:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939070374] [2025-02-05 17:57:21,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939070374] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:21,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:21,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:57:21,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994721624] [2025-02-05 17:57:21,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:57:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:21,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:57:21,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:21,847 INFO L87 Difference]: Start difference. First operand 3168 states and 4078 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:21,933 INFO L93 Difference]: Finished difference Result 4581 states and 5816 transitions. [2025-02-05 17:57:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:57:21,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 108 [2025-02-05 17:57:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:21,946 INFO L225 Difference]: With dead ends: 4581 [2025-02-05 17:57:21,947 INFO L226 Difference]: Without dead ends: 1752 [2025-02-05 17:57:21,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:57:21,954 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 140 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:21,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1153 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:21,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2025-02-05 17:57:22,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2025-02-05 17:57:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1417 states have (on average 1.3062808750882144) internal successors, (1851), 1438 states have internal predecessors, (1851), 183 states have call successors, (183), 115 states have call predecessors, (183), 150 states have return successors, (224), 200 states have call predecessors, (224), 179 states have call successors, (224) [2025-02-05 17:57:22,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2258 transitions. [2025-02-05 17:57:22,081 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2258 transitions. Word has length 108 [2025-02-05 17:57:22,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:22,082 INFO L471 AbstractCegarLoop]: Abstraction has 1752 states and 2258 transitions. [2025-02-05 17:57:22,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:57:22,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2258 transitions. [2025-02-05 17:57:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 17:57:22,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:22,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2025-02-05 17:57:22,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:57:22,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:22,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash -42058896, now seen corresponding path program 1 times [2025-02-05 17:57:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542507490] [2025-02-05 17:57:22,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:22,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 17:57:22,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 17:57:22,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:22,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 17:57:22,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:22,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542507490] [2025-02-05 17:57:22,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542507490] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:57:22,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664600793] [2025-02-05 17:57:22,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:22,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:57:22,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:57:22,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:57:22,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:57:22,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 17:57:22,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 17:57:22,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:22,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:22,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:57:22,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:57:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:57:22,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:57:22,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664600793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:22,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:57:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-02-05 17:57:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327208167] [2025-02-05 17:57:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:22,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:57:22,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:22,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:57:22,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:22,447 INFO L87 Difference]: Start difference. First operand 1752 states and 2258 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:57:22,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:22,475 INFO L93 Difference]: Finished difference Result 1838 states and 2358 transitions. [2025-02-05 17:57:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:57:22,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2025-02-05 17:57:22,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:22,481 INFO L225 Difference]: With dead ends: 1838 [2025-02-05 17:57:22,481 INFO L226 Difference]: Without dead ends: 330 [2025-02-05 17:57:22,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:57:22,484 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 45 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:22,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1120 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:57:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-05 17:57:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-02-05 17:57:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 298 states have (on average 1.5335570469798658) internal successors, (457), 300 states have internal predecessors, (457), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 17:57:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 505 transitions. [2025-02-05 17:57:22,498 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 505 transitions. Word has length 110 [2025-02-05 17:57:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:22,498 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 505 transitions. [2025-02-05 17:57:22,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:57:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 505 transitions. [2025-02-05 17:57:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:22,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:22,500 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] [2025-02-05 17:57:22,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:57:22,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 17:57:22,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:22,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash -375214524, now seen corresponding path program 1 times [2025-02-05 17:57:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:22,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262862105] [2025-02-05 17:57:22,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:22,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:22,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:22,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:22,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262862105] [2025-02-05 17:57:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262862105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:22,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:22,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:22,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096599956] [2025-02-05 17:57:22,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:22,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:22,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:22,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:22,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:22,849 INFO L87 Difference]: Start difference. First operand 330 states and 505 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:23,343 INFO L93 Difference]: Finished difference Result 990 states and 1529 transitions. [2025-02-05 17:57:23,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:57:23,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:23,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:23,351 INFO L225 Difference]: With dead ends: 990 [2025-02-05 17:57:23,351 INFO L226 Difference]: Without dead ends: 678 [2025-02-05 17:57:23,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:23,353 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 931 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:23,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1417 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:57:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-05 17:57:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 653. [2025-02-05 17:57:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 596 states have (on average 1.5436241610738255) internal successors, (920), 599 states have internal predecessors, (920), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:57:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1005 transitions. [2025-02-05 17:57:23,377 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1005 transitions. Word has length 146 [2025-02-05 17:57:23,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:23,378 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 1005 transitions. [2025-02-05 17:57:23,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:23,378 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1005 transitions. [2025-02-05 17:57:23,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:23,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:23,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] [2025-02-05 17:57:23,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:57:23,380 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:23,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash 871536322, now seen corresponding path program 1 times [2025-02-05 17:57:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:23,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717450532] [2025-02-05 17:57:23,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:23,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:23,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:23,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:23,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:23,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:23,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717450532] [2025-02-05 17:57:23,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717450532] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:23,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:23,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457623378] [2025-02-05 17:57:23,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:23,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:23,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:23,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:23,531 INFO L87 Difference]: Start difference. First operand 653 states and 1005 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:24,271 INFO L93 Difference]: Finished difference Result 1695 states and 2638 transitions. [2025-02-05 17:57:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:24,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:24,279 INFO L225 Difference]: With dead ends: 1695 [2025-02-05 17:57:24,279 INFO L226 Difference]: Without dead ends: 1060 [2025-02-05 17:57:24,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:24,282 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 934 mSDsluCounter, 2079 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 2756 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:24,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 2756 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:57:24,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-02-05 17:57:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 955. [2025-02-05 17:57:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 873 states have (on average 1.5360824742268042) internal successors, (1341), 877 states have internal predecessors, (1341), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-02-05 17:57:24,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1465 transitions. [2025-02-05 17:57:24,336 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1465 transitions. Word has length 146 [2025-02-05 17:57:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:24,336 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1465 transitions. [2025-02-05 17:57:24,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1465 transitions. [2025-02-05 17:57:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:24,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:24,338 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] [2025-02-05 17:57:24,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:57:24,339 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:24,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1629245629, now seen corresponding path program 1 times [2025-02-05 17:57:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463390887] [2025-02-05 17:57:24,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:24,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:24,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:24,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:24,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:24,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:24,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463390887] [2025-02-05 17:57:24,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463390887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:24,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:24,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541354109] [2025-02-05 17:57:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:24,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:24,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:24,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:24,539 INFO L87 Difference]: Start difference. First operand 955 states and 1465 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:25,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:25,242 INFO L93 Difference]: Finished difference Result 2653 states and 4121 transitions. [2025-02-05 17:57:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:25,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:25,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:25,252 INFO L225 Difference]: With dead ends: 2653 [2025-02-05 17:57:25,252 INFO L226 Difference]: Without dead ends: 1716 [2025-02-05 17:57:25,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:25,255 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 929 mSDsluCounter, 2067 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:25,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 2740 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2025-02-05 17:57:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1596. [2025-02-05 17:57:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1596 states, 1462 states have (on average 1.5389876880984952) internal successors, (2250), 1470 states have internal predecessors, (2250), 97 states have call successors, (97), 31 states have call predecessors, (97), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-02-05 17:57:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 2458 transitions. [2025-02-05 17:57:25,325 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 2458 transitions. Word has length 146 [2025-02-05 17:57:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:25,326 INFO L471 AbstractCegarLoop]: Abstraction has 1596 states and 2458 transitions. [2025-02-05 17:57:25,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 2458 transitions. [2025-02-05 17:57:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:25,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:25,329 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] [2025-02-05 17:57:25,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:57:25,329 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:25,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:25,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1155726686, now seen corresponding path program 1 times [2025-02-05 17:57:25,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:25,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549646368] [2025-02-05 17:57:25,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:25,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:25,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:25,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:25,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:25,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-02-05 17:57:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:25,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549646368] [2025-02-05 17:57:25,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549646368] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:25,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:25,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18657940] [2025-02-05 17:57:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:25,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:25,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:25,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:25,479 INFO L87 Difference]: Start difference. First operand 1596 states and 2458 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:26,195 INFO L93 Difference]: Finished difference Result 4712 states and 7376 transitions. [2025-02-05 17:57:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:26,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:26,211 INFO L225 Difference]: With dead ends: 4712 [2025-02-05 17:57:26,211 INFO L226 Difference]: Without dead ends: 3134 [2025-02-05 17:57:26,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:26,216 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 924 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:26,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 2728 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:26,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2025-02-05 17:57:26,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 2983. [2025-02-05 17:57:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2739 states have (on average 1.5545819642205185) internal successors, (4258), 2761 states have internal predecessors, (4258), 169 states have call successors, (169), 55 states have call predecessors, (169), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-02-05 17:57:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4658 transitions. [2025-02-05 17:57:26,355 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4658 transitions. Word has length 146 [2025-02-05 17:57:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:26,356 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 4658 transitions. [2025-02-05 17:57:26,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4658 transitions. [2025-02-05 17:57:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:26,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:26,359 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] [2025-02-05 17:57:26,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:57:26,359 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:26,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash -724809885, now seen corresponding path program 1 times [2025-02-05 17:57:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:26,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102059838] [2025-02-05 17:57:26,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:26,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:26,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:26,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:26,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:26,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:26,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102059838] [2025-02-05 17:57:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102059838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:26,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:26,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595459243] [2025-02-05 17:57:26,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:26,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:26,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:26,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:26,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:26,506 INFO L87 Difference]: Start difference. First operand 2983 states and 4658 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:27,320 INFO L93 Difference]: Finished difference Result 9231 states and 14730 transitions. [2025-02-05 17:57:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:27,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:27,353 INFO L225 Difference]: With dead ends: 9231 [2025-02-05 17:57:27,353 INFO L226 Difference]: Without dead ends: 6266 [2025-02-05 17:57:27,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:27,362 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 919 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 2716 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:27,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 2716 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:27,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6266 states. [2025-02-05 17:57:27,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 6054. [2025-02-05 17:57:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6054 states, 5572 states have (on average 1.5811198851399857) internal successors, (8810), 5640 states have internal predecessors, (8810), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:57:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6054 states to 6054 states and 9690 transitions. [2025-02-05 17:57:27,602 INFO L78 Accepts]: Start accepts. Automaton has 6054 states and 9690 transitions. Word has length 146 [2025-02-05 17:57:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:27,604 INFO L471 AbstractCegarLoop]: Abstraction has 6054 states and 9690 transitions. [2025-02-05 17:57:27,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6054 states and 9690 transitions. [2025-02-05 17:57:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:27,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:27,609 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] [2025-02-05 17:57:27,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:57:27,610 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:27,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash 397469314, now seen corresponding path program 1 times [2025-02-05 17:57:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:27,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310097370] [2025-02-05 17:57:27,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:27,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:27,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:27,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:27,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:27,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:27,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:27,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:27,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310097370] [2025-02-05 17:57:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310097370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:27,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328650109] [2025-02-05 17:57:27,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:27,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:27,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:27,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:27,780 INFO L87 Difference]: Start difference. First operand 6054 states and 9690 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:28,303 INFO L93 Difference]: Finished difference Result 13418 states and 22049 transitions. [2025-02-05 17:57:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:28,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:28,343 INFO L225 Difference]: With dead ends: 13418 [2025-02-05 17:57:28,344 INFO L226 Difference]: Without dead ends: 7382 [2025-02-05 17:57:28,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:28,387 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 666 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:28,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1008 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2025-02-05 17:57:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 6054. [2025-02-05 17:57:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6054 states, 5572 states have (on average 1.5780689160086145) internal successors, (8793), 5640 states have internal predecessors, (8793), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:57:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6054 states to 6054 states and 9673 transitions. [2025-02-05 17:57:28,660 INFO L78 Accepts]: Start accepts. Automaton has 6054 states and 9673 transitions. Word has length 146 [2025-02-05 17:57:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:28,660 INFO L471 AbstractCegarLoop]: Abstraction has 6054 states and 9673 transitions. [2025-02-05 17:57:28,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:28,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6054 states and 9673 transitions. [2025-02-05 17:57:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:28,665 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:28,665 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] [2025-02-05 17:57:28,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:57:28,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:28,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:28,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1505990781, now seen corresponding path program 1 times [2025-02-05 17:57:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173225843] [2025-02-05 17:57:28,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:28,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:28,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:28,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:28,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:28,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173225843] [2025-02-05 17:57:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173225843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:28,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:28,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599623245] [2025-02-05 17:57:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:28,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:28,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:28,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:28,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:28,822 INFO L87 Difference]: Start difference. First operand 6054 states and 9673 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:29,409 INFO L93 Difference]: Finished difference Result 13335 states and 21849 transitions. [2025-02-05 17:57:29,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:29,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:29,449 INFO L225 Difference]: With dead ends: 13335 [2025-02-05 17:57:29,449 INFO L226 Difference]: Without dead ends: 7299 [2025-02-05 17:57:29,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:29,467 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 663 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:29,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1000 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7299 states. [2025-02-05 17:57:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7299 to 6054. [2025-02-05 17:57:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6054 states, 5572 states have (on average 1.5750179468772434) internal successors, (8776), 5640 states have internal predecessors, (8776), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:57:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6054 states to 6054 states and 9656 transitions. [2025-02-05 17:57:29,783 INFO L78 Accepts]: Start accepts. Automaton has 6054 states and 9656 transitions. Word has length 146 [2025-02-05 17:57:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:29,783 INFO L471 AbstractCegarLoop]: Abstraction has 6054 states and 9656 transitions. [2025-02-05 17:57:29,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6054 states and 9656 transitions. [2025-02-05 17:57:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:29,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:29,789 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] [2025-02-05 17:57:29,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:57:29,789 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:29,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:29,790 INFO L85 PathProgramCache]: Analyzing trace with hash 95175266, now seen corresponding path program 1 times [2025-02-05 17:57:29,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:29,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688818293] [2025-02-05 17:57:29,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:29,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:29,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:29,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:29,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:29,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:29,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688818293] [2025-02-05 17:57:29,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688818293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:29,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:29,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:29,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905864349] [2025-02-05 17:57:29,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:29,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:29,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:29,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:29,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:29,895 INFO L87 Difference]: Start difference. First operand 6054 states and 9656 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:30,433 INFO L93 Difference]: Finished difference Result 13252 states and 21649 transitions. [2025-02-05 17:57:30,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:30,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:30,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:30,465 INFO L225 Difference]: With dead ends: 13252 [2025-02-05 17:57:30,466 INFO L226 Difference]: Without dead ends: 7216 [2025-02-05 17:57:30,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:30,481 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 660 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:30,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 992 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7216 states. [2025-02-05 17:57:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7216 to 6054. [2025-02-05 17:57:30,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6054 states, 5572 states have (on average 1.5719669777458722) internal successors, (8759), 5640 states have internal predecessors, (8759), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:57:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6054 states to 6054 states and 9639 transitions. [2025-02-05 17:57:30,774 INFO L78 Accepts]: Start accepts. Automaton has 6054 states and 9639 transitions. Word has length 146 [2025-02-05 17:57:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:30,775 INFO L471 AbstractCegarLoop]: Abstraction has 6054 states and 9639 transitions. [2025-02-05 17:57:30,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 6054 states and 9639 transitions. [2025-02-05 17:57:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:30,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:30,780 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] [2025-02-05 17:57:30,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:57:30,781 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:30,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash -545910877, now seen corresponding path program 1 times [2025-02-05 17:57:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:30,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602823078] [2025-02-05 17:57:30,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:30,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:30,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:30,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:30,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:30,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:30,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602823078] [2025-02-05 17:57:30,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602823078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:30,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:30,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:30,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211477205] [2025-02-05 17:57:30,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:30,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:30,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:30,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:30,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:30,922 INFO L87 Difference]: Start difference. First operand 6054 states and 9639 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:32,169 INFO L93 Difference]: Finished difference Result 19098 states and 31195 transitions. [2025-02-05 17:57:32,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:32,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:32,234 INFO L225 Difference]: With dead ends: 19098 [2025-02-05 17:57:32,234 INFO L226 Difference]: Without dead ends: 13062 [2025-02-05 17:57:32,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:32,257 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 890 mSDsluCounter, 1998 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 2647 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:32,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 2647 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13062 states. [2025-02-05 17:57:32,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13062 to 12790. [2025-02-05 17:57:32,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12790 states, 11778 states have (on average 1.598998132110715) internal successors, (18833), 11992 states have internal predecessors, (18833), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-02-05 17:57:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 21057 transitions. [2025-02-05 17:57:32,877 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 21057 transitions. Word has length 146 [2025-02-05 17:57:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:32,877 INFO L471 AbstractCegarLoop]: Abstraction has 12790 states and 21057 transitions. [2025-02-05 17:57:32,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 21057 transitions. [2025-02-05 17:57:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:32,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:32,884 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] [2025-02-05 17:57:32,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:57:32,884 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:32,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash 680334914, now seen corresponding path program 1 times [2025-02-05 17:57:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:32,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651535673] [2025-02-05 17:57:32,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:32,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:32,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:32,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:32,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651535673] [2025-02-05 17:57:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651535673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:57:32,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941874857] [2025-02-05 17:57:32,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:32,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:57:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:32,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:57:32,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:57:32,986 INFO L87 Difference]: Start difference. First operand 12790 states and 21057 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:33,877 INFO L93 Difference]: Finished difference Result 28502 states and 48321 transitions. [2025-02-05 17:57:33,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:57:33,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:33,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:33,953 INFO L225 Difference]: With dead ends: 28502 [2025-02-05 17:57:33,953 INFO L226 Difference]: Without dead ends: 15730 [2025-02-05 17:57:33,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:33,989 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 656 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:33,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 978 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:57:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2025-02-05 17:57:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 12790. [2025-02-05 17:57:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12790 states, 11778 states have (on average 1.596196298183053) internal successors, (18800), 11992 states have internal predecessors, (18800), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-02-05 17:57:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 21024 transitions. [2025-02-05 17:57:34,612 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 21024 transitions. Word has length 146 [2025-02-05 17:57:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:34,612 INFO L471 AbstractCegarLoop]: Abstraction has 12790 states and 21024 transitions. [2025-02-05 17:57:34,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 21024 transitions. [2025-02-05 17:57:34,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:34,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:34,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:57:34,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:57:34,619 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:34,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:34,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1966817219, now seen corresponding path program 1 times [2025-02-05 17:57:34,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:34,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351342657] [2025-02-05 17:57:34,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:34,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:34,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:34,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:34,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:34,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:34,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351342657] [2025-02-05 17:57:34,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351342657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:34,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:34,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443273226] [2025-02-05 17:57:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:34,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:34,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:34,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:34,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:34,735 INFO L87 Difference]: Start difference. First operand 12790 states and 21024 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:36,878 INFO L93 Difference]: Finished difference Result 43240 states and 73229 transitions. [2025-02-05 17:57:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:37,005 INFO L225 Difference]: With dead ends: 43240 [2025-02-05 17:57:37,006 INFO L226 Difference]: Without dead ends: 30468 [2025-02-05 17:57:37,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:37,041 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 1161 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:37,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 2603 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:57:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30468 states. [2025-02-05 17:57:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30468 to 27786. [2025-02-05 17:57:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27786 states, 25584 states have (on average 1.6256253908692933) internal successors, (41590), 26252 states have internal predecessors, (41590), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-02-05 17:57:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27786 states to 27786 states and 47974 transitions. [2025-02-05 17:57:38,301 INFO L78 Accepts]: Start accepts. Automaton has 27786 states and 47974 transitions. Word has length 146 [2025-02-05 17:57:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:38,302 INFO L471 AbstractCegarLoop]: Abstraction has 27786 states and 47974 transitions. [2025-02-05 17:57:38,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 27786 states and 47974 transitions. [2025-02-05 17:57:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:38,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:38,313 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] [2025-02-05 17:57:38,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 17:57:38,313 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:38,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash -346987998, now seen corresponding path program 1 times [2025-02-05 17:57:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253024117] [2025-02-05 17:57:38,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:38,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:38,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:38,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:38,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:38,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:38,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:38,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253024117] [2025-02-05 17:57:38,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253024117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:38,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:38,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348455861] [2025-02-05 17:57:38,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:38,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:38,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:38,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:38,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:38,430 INFO L87 Difference]: Start difference. First operand 27786 states and 47974 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:41,771 INFO L93 Difference]: Finished difference Result 94794 states and 171129 transitions. [2025-02-05 17:57:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:42,095 INFO L225 Difference]: With dead ends: 94794 [2025-02-05 17:57:42,096 INFO L226 Difference]: Without dead ends: 67026 [2025-02-05 17:57:42,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:42,203 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 1125 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2587 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:42,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 2587 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 17:57:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67026 states. [2025-02-05 17:57:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67026 to 61595. [2025-02-05 17:57:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61595 states, 56559 states have (on average 1.655510175215262) internal successors, (93634), 58621 states have internal predecessors, (93634), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:57:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61595 states to 61595 states and 114418 transitions. [2025-02-05 17:57:45,909 INFO L78 Accepts]: Start accepts. Automaton has 61595 states and 114418 transitions. Word has length 146 [2025-02-05 17:57:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:57:45,909 INFO L471 AbstractCegarLoop]: Abstraction has 61595 states and 114418 transitions. [2025-02-05 17:57:45,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 61595 states and 114418 transitions. [2025-02-05 17:57:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 17:57:45,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:57:45,931 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] [2025-02-05 17:57:45,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 17:57:45,932 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:57:45,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:57:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1530005533, now seen corresponding path program 1 times [2025-02-05 17:57:45,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:57:45,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463426893] [2025-02-05 17:57:45,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:57:45,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:57:45,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 17:57:45,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 17:57:45,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:57:45,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:57:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:57:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:57:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463426893] [2025-02-05 17:57:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463426893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:57:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:57:46,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:57:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780835394] [2025-02-05 17:57:46,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:57:46,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:57:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:57:46,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:57:46,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:57:46,068 INFO L87 Difference]: Start difference. First operand 61595 states and 114418 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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-02-05 17:57:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:57:52,336 INFO L93 Difference]: Finished difference Result 212195 states and 421107 transitions. [2025-02-05 17:57:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:57:52,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (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 146 [2025-02-05 17:57:52,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:57:53,149 INFO L225 Difference]: With dead ends: 212195 [2025-02-05 17:57:53,149 INFO L226 Difference]: Without dead ends: 150618 [2025-02-05 17:57:53,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:57:53,384 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 1091 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:57:53,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 2579 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:57:53,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150618 states.