./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_2.cil-1+token_ring.02.cil-1.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 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:03:41,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:03:41,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 06:03:41,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:03:41,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:03:41,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:03:41,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:03:41,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:03:41,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:03:41,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:03:41,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:03:41,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:03:41,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:03:41,172 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:03:41,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:03:41,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:03:41,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:03:41,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:03:41,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:03:41,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:03:41,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:03:41,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:03:41,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:03:41,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:03:41,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:03:41,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:03:41,175 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 -> 0792bb078b549cb8c62d642eddb09d42b03fb2451c67a454a8e8576be6796f29 [2025-01-09 06:03:41,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:03:41,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:03:41,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:03:41,441 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:03:41,441 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:03:41,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2025-01-09 06:03:42,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6fa37465/22f2d4abfa8643c3b96130617631c94b/FLAGb01996ad9 [2025-01-09 06:03:43,002 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:03:43,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2025-01-09 06:03:43,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6fa37465/22f2d4abfa8643c3b96130617631c94b/FLAGb01996ad9 [2025-01-09 06:03:43,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6fa37465/22f2d4abfa8643c3b96130617631c94b [2025-01-09 06:03:43,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:03:43,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:03:43,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:03:43,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:03:43,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:03:43,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e22e2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43, skipping insertion in model container [2025-01-09 06:03:43,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:03:43,254 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_2.cil-1+token_ring.02.cil-1.c[914,927] [2025-01-09 06:03:43,294 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_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2025-01-09 06:03:43,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:03:43,325 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:03:43,336 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_2.cil-1+token_ring.02.cil-1.c[914,927] [2025-01-09 06:03:43,363 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_2.cil-1+token_ring.02.cil-1.c[7115,7128] [2025-01-09 06:03:43,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:03:43,414 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:03:43,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43 WrapperNode [2025-01-09 06:03:43,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:03:43,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:03:43,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:03:43,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:03:43,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,461 INFO L138 Inliner]: procedures = 57, calls = 63, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 441 [2025-01-09 06:03:43,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:03:43,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:03:43,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:03:43,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:03:43,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,498 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-01-09 06:03:43,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:03:43,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:03:43,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:03:43,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:03:43,527 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (1/1) ... [2025-01-09 06:03:43,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:03:43,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:43,564 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-01-09 06:03:43,571 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-01-09 06:03:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:03:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:03:43,602 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:03:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:03:43,602 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:03:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:03:43,602 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:03:43,602 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:03:43,602 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:03:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:03:43,603 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:03:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:03:43,603 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:03:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:03:43,603 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:03:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:03:43,603 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:03:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:03:43,603 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:03:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:03:43,603 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:03:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:03:43,603 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:03:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:03:43,603 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:03:43,603 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:03:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:03:43,604 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:03:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:03:43,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:03:43,604 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:03:43,604 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:03:43,684 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:03:43,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:03:44,126 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-01-09 06:03:44,126 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:03:44,143 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:03:44,146 INFO L312 CfgBuilder]: Removed 9 assume(true) statements. [2025-01-09 06:03:44,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:03:44 BoogieIcfgContainer [2025-01-09 06:03:44,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:03:44,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:03:44,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:03:44,153 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:03:44,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:03:43" (1/3) ... [2025-01-09 06:03:44,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee7af90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:03:44, skipping insertion in model container [2025-01-09 06:03:44,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:03:43" (2/3) ... [2025-01-09 06:03:44,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee7af90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:03:44, skipping insertion in model container [2025-01-09 06:03:44,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:03:44" (3/3) ... [2025-01-09 06:03:44,156 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c [2025-01-09 06:03:44,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:03:44,169 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.02.cil-1.c that has 15 procedures, 227 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-01-09 06:03:44,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:03:44,247 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;@1e19cba7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:03:44,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:03:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 182 states have (on average 1.5054945054945055) internal successors, (274), 186 states have internal predecessors, (274), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 06:03:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:03:44,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:44,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:44,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:44,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:44,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1753957511, now seen corresponding path program 1 times [2025-01-09 06:03:44,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:44,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124504646] [2025-01-09 06:03:44,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:44,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:44,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:03:44,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:03:44,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:44,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:44,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:44,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124504646] [2025-01-09 06:03:44,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124504646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:44,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:44,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:03:44,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669958409] [2025-01-09 06:03:44,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:44,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:44,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:44,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:44,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:03:44,559 INFO L87 Difference]: Start difference. First operand has 227 states, 182 states have (on average 1.5054945054945055) internal successors, (274), 186 states have internal predecessors, (274), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-01-09 06:03:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:44,605 INFO L93 Difference]: Finished difference Result 437 states and 641 transitions. [2025-01-09 06:03:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:44,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 62 [2025-01-09 06:03:44,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:44,614 INFO L225 Difference]: With dead ends: 437 [2025-01-09 06:03:44,614 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 06:03:44,617 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-01-09 06:03:44,619 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 127 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 505 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-01-09 06:03:44,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 505 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 06:03:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-01-09 06:03:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 172 states have (on average 1.4651162790697674) internal successors, (252), 176 states have internal predecessors, (252), 30 states have call successors, (30), 14 states have call predecessors, (30), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 06:03:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 310 transitions. [2025-01-09 06:03:44,663 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 310 transitions. Word has length 62 [2025-01-09 06:03:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:44,663 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 310 transitions. [2025-01-09 06:03:44,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-01-09 06:03:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 310 transitions. [2025-01-09 06:03:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:03:44,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:44,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:44,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:03:44,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:44,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:44,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1310056837, now seen corresponding path program 1 times [2025-01-09 06:03:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:44,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134854203] [2025-01-09 06:03:44,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:44,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:44,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:03:44,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:03:44,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:44,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:44,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:44,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134854203] [2025-01-09 06:03:44,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134854203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:44,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:44,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982024689] [2025-01-09 06:03:44,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:44,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:44,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:44,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:44,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:44,887 INFO L87 Difference]: Start difference. First operand 217 states and 310 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:03:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:45,470 INFO L93 Difference]: Finished difference Result 400 states and 570 transitions. [2025-01-09 06:03:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:03:45,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:03:45,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:45,475 INFO L225 Difference]: With dead ends: 400 [2025-01-09 06:03:45,478 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 06:03:45,479 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-01-09 06:03:45,484 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 270 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:45,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 686 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:03:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 06:03:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 309. [2025-01-09 06:03:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 244 states have (on average 1.4426229508196722) internal successors, (352), 250 states have internal predecessors, (352), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2025-01-09 06:03:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 437 transitions. [2025-01-09 06:03:45,531 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 437 transitions. Word has length 62 [2025-01-09 06:03:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:45,531 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 437 transitions. [2025-01-09 06:03:45,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:03:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 437 transitions. [2025-01-09 06:03:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:03:45,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:45,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:45,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:03:45,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:45,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:45,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1513392837, now seen corresponding path program 1 times [2025-01-09 06:03:45,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:45,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559278949] [2025-01-09 06:03:45,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:45,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:03:45,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:03:45,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:45,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:45,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:45,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559278949] [2025-01-09 06:03:45,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559278949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:45,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:45,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157574794] [2025-01-09 06:03:45,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:45,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:45,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:45,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:45,657 INFO L87 Difference]: Start difference. First operand 309 states and 437 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:03:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:45,698 INFO L93 Difference]: Finished difference Result 483 states and 677 transitions. [2025-01-09 06:03:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:03:45,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-01-09 06:03:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:45,700 INFO L225 Difference]: With dead ends: 483 [2025-01-09 06:03:45,700 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 06:03:45,701 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-01-09 06:03:45,702 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 0 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1530 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-01-09 06:03:45,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1530 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 06:03:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-01-09 06:03:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 248 states have (on average 1.4314516129032258) internal successors, (355), 254 states have internal predecessors, (355), 41 states have call successors, (41), 21 states have call predecessors, (41), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2025-01-09 06:03:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 441 transitions. [2025-01-09 06:03:45,718 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 441 transitions. Word has length 62 [2025-01-09 06:03:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:45,719 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 441 transitions. [2025-01-09 06:03:45,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:03:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 441 transitions. [2025-01-09 06:03:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:03:45,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:45,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:45,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:03:45,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:45,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash 669387335, now seen corresponding path program 1 times [2025-01-09 06:03:45,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393155719] [2025-01-09 06:03:45,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:45,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:45,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:03:45,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:03:45,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:45,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:45,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:45,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:45,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393155719] [2025-01-09 06:03:45,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393155719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:45,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:45,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:45,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543791830] [2025-01-09 06:03:45,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:45,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:45,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:45,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:45,822 INFO L87 Difference]: Start difference. First operand 314 states and 441 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:03:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:46,308 INFO L93 Difference]: Finished difference Result 1595 states and 2222 transitions. [2025-01-09 06:03:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:46,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-01-09 06:03:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:46,322 INFO L225 Difference]: With dead ends: 1595 [2025-01-09 06:03:46,322 INFO L226 Difference]: Without dead ends: 1421 [2025-01-09 06:03:46,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:03:46,324 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 1104 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:46,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1626 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:03:46,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-01-09 06:03:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1325. [2025-01-09 06:03:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 1037 states have (on average 1.3645130183220828) internal successors, (1415), 1057 states have internal predecessors, (1415), 151 states have call successors, (151), 117 states have call predecessors, (151), 135 states have return successors, (209), 153 states have call predecessors, (209), 149 states have call successors, (209) [2025-01-09 06:03:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1775 transitions. [2025-01-09 06:03:46,487 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1775 transitions. Word has length 62 [2025-01-09 06:03:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:46,488 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 1775 transitions. [2025-01-09 06:03:46,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:03:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1775 transitions. [2025-01-09 06:03:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:03:46,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:46,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] [2025-01-09 06:03:46,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:03:46,492 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:46,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1588361958, now seen corresponding path program 1 times [2025-01-09 06:03:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:46,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654521000] [2025-01-09 06:03:46,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:46,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:46,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:03:46,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:03:46,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:46,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:46,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-01-09 06:03:46,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:46,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654521000] [2025-01-09 06:03:46,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654521000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:46,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:46,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084956481] [2025-01-09 06:03:46,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:46,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:46,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:46,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:46,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:46,591 INFO L87 Difference]: Start difference. First operand 1325 states and 1775 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:03:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:46,696 INFO L93 Difference]: Finished difference Result 2540 states and 3419 transitions. [2025-01-09 06:03:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:03:46,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-01-09 06:03:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:46,708 INFO L225 Difference]: With dead ends: 2540 [2025-01-09 06:03:46,711 INFO L226 Difference]: Without dead ends: 1355 [2025-01-09 06:03:46,714 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-01-09 06:03:46,717 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 0 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1530 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-01-09 06:03:46,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1530 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:46,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2025-01-09 06:03:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2025-01-09 06:03:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 1061 states have (on average 1.3468426013195098) internal successors, (1429), 1081 states have internal predecessors, (1429), 151 states have call successors, (151), 117 states have call predecessors, (151), 141 states have return successors, (221), 159 states have call predecessors, (221), 149 states have call successors, (221) [2025-01-09 06:03:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1801 transitions. [2025-01-09 06:03:46,824 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1801 transitions. Word has length 62 [2025-01-09 06:03:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:46,824 INFO L471 AbstractCegarLoop]: Abstraction has 1355 states and 1801 transitions. [2025-01-09 06:03:46,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:03:46,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1801 transitions. [2025-01-09 06:03:46,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:03:46,826 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:46,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:46,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:03:46,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:46,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:46,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1650401572, now seen corresponding path program 1 times [2025-01-09 06:03:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:46,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82503537] [2025-01-09 06:03:46,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:46,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:03:46,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:03:46,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:46,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:47,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82503537] [2025-01-09 06:03:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82503537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:47,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767598513] [2025-01-09 06:03:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:47,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:47,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:47,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:47,017 INFO L87 Difference]: Start difference. First operand 1355 states and 1801 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:03:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:47,609 INFO L93 Difference]: Finished difference Result 3402 states and 4481 transitions. [2025-01-09 06:03:47,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:03:47,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:03:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:47,621 INFO L225 Difference]: With dead ends: 3402 [2025-01-09 06:03:47,621 INFO L226 Difference]: Without dead ends: 2189 [2025-01-09 06:03:47,625 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-01-09 06:03:47,626 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 460 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:47,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 710 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:03:47,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2025-01-09 06:03:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2013. [2025-01-09 06:03:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1573 states have (on average 1.326128417037508) internal successors, (2086), 1612 states have internal predecessors, (2086), 218 states have call successors, (218), 173 states have call predecessors, (218), 220 states have return successors, (353), 231 states have call predecessors, (353), 216 states have call successors, (353) [2025-01-09 06:03:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2657 transitions. [2025-01-09 06:03:47,743 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2657 transitions. Word has length 62 [2025-01-09 06:03:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:47,744 INFO L471 AbstractCegarLoop]: Abstraction has 2013 states and 2657 transitions. [2025-01-09 06:03:47,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:03:47,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2657 transitions. [2025-01-09 06:03:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:03:47,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:47,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:47,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:03:47,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:47,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:47,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2073103398, now seen corresponding path program 1 times [2025-01-09 06:03:47,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:47,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078742865] [2025-01-09 06:03:47,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:47,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:03:47,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:03:47,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:47,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:47,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078742865] [2025-01-09 06:03:47,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078742865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:47,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:47,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:03:47,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211656501] [2025-01-09 06:03:47,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:47,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:03:47,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:47,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:03:47,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:03:47,854 INFO L87 Difference]: Start difference. First operand 2013 states and 2657 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:03:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:48,204 INFO L93 Difference]: Finished difference Result 5453 states and 7206 transitions. [2025-01-09 06:03:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:03:48,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:03:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:48,223 INFO L225 Difference]: With dead ends: 5453 [2025-01-09 06:03:48,223 INFO L226 Difference]: Without dead ends: 3589 [2025-01-09 06:03:48,229 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-01-09 06:03:48,230 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 417 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:48,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 357 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:03:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2025-01-09 06:03:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3585. [2025-01-09 06:03:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 2782 states have (on average 1.2904385334291877) internal successors, (3590), 2852 states have internal predecessors, (3590), 387 states have call successors, (387), 318 states have call predecessors, (387), 414 states have return successors, (699), 418 states have call predecessors, (699), 385 states have call successors, (699) [2025-01-09 06:03:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4676 transitions. [2025-01-09 06:03:48,453 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4676 transitions. Word has length 62 [2025-01-09 06:03:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:48,453 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 4676 transitions. [2025-01-09 06:03:48,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:03:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4676 transitions. [2025-01-09 06:03:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:03:48,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:48,455 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:48,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:03:48,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:48,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:48,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1921925492, now seen corresponding path program 1 times [2025-01-09 06:03:48,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:48,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543273331] [2025-01-09 06:03:48,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:48,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:48,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:03:48,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:03:48,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:48,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:48,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:48,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543273331] [2025-01-09 06:03:48,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543273331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:48,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:48,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:03:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915276933] [2025-01-09 06:03:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:48,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:03:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:48,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:03:48,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:03:48,488 INFO L87 Difference]: Start difference. First operand 3585 states and 4676 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:03:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:48,835 INFO L93 Difference]: Finished difference Result 9419 states and 12374 transitions. [2025-01-09 06:03:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:03:48,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-01-09 06:03:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:48,865 INFO L225 Difference]: With dead ends: 9419 [2025-01-09 06:03:48,866 INFO L226 Difference]: Without dead ends: 5962 [2025-01-09 06:03:48,877 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-01-09 06:03:48,878 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 101 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:48,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 601 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:03:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2025-01-09 06:03:49,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 5816. [2025-01-09 06:03:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5816 states, 4463 states have (on average 1.2814250504145195) internal successors, (5719), 4558 states have internal predecessors, (5719), 653 states have call successors, (653), 550 states have call predecessors, (653), 698 states have return successors, (1171), 711 states have call predecessors, (1171), 651 states have call successors, (1171) [2025-01-09 06:03:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5816 states to 5816 states and 7543 transitions. [2025-01-09 06:03:49,228 INFO L78 Accepts]: Start accepts. Automaton has 5816 states and 7543 transitions. Word has length 63 [2025-01-09 06:03:49,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:49,228 INFO L471 AbstractCegarLoop]: Abstraction has 5816 states and 7543 transitions. [2025-01-09 06:03:49,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:03:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 5816 states and 7543 transitions. [2025-01-09 06:03:49,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:03:49,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:49,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:49,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:03:49,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:49,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:49,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1256979250, now seen corresponding path program 1 times [2025-01-09 06:03:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:49,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855794648] [2025-01-09 06:03:49,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:49,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:03:49,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:03:49,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:49,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:49,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:49,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855794648] [2025-01-09 06:03:49,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855794648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:49,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:49,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:03:49,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042084918] [2025-01-09 06:03:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:49,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:03:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:49,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:03:49,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:03:49,326 INFO L87 Difference]: Start difference. First operand 5816 states and 7543 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:03:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:49,698 INFO L93 Difference]: Finished difference Result 6946 states and 8946 transitions. [2025-01-09 06:03:49,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:03:49,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-01-09 06:03:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:49,734 INFO L225 Difference]: With dead ends: 6946 [2025-01-09 06:03:49,734 INFO L226 Difference]: Without dead ends: 6943 [2025-01-09 06:03:49,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:49,742 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 563 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:49,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 410 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:03:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6943 states. [2025-01-09 06:03:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6943 to 6844. [2025-01-09 06:03:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6844 states, 5234 states have (on average 1.2730225448987391) internal successors, (6663), 5344 states have internal predecessors, (6663), 779 states have call successors, (779), 664 states have call predecessors, (779), 829 states have return successors, (1376), 839 states have call predecessors, (1376), 778 states have call successors, (1376) [2025-01-09 06:03:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6844 states to 6844 states and 8818 transitions. [2025-01-09 06:03:50,254 INFO L78 Accepts]: Start accepts. Automaton has 6844 states and 8818 transitions. Word has length 68 [2025-01-09 06:03:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:50,255 INFO L471 AbstractCegarLoop]: Abstraction has 6844 states and 8818 transitions. [2025-01-09 06:03:50,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:03:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 6844 states and 8818 transitions. [2025-01-09 06:03:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 06:03:50,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:50,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:50,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:03:50,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:50,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash 310976943, now seen corresponding path program 1 times [2025-01-09 06:03:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:50,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592780022] [2025-01-09 06:03:50,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:50,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:03:50,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:03:50,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:50,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592780022] [2025-01-09 06:03:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592780022] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:03:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411098734] [2025-01-09 06:03:50,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:50,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:03:50,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:03:50,396 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-01-09 06:03:50,400 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-01-09 06:03:50,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:03:50,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:03:50,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:50,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:50,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:03:50,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:03:50,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:50,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:03:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:50,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411098734] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:03:50,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:03:50,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-09 06:03:50,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709358057] [2025-01-09 06:03:50,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:03:50,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:03:50,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:50,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:03:50,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:03:50,844 INFO L87 Difference]: Start difference. First operand 6844 states and 8818 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:03:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:51,830 INFO L93 Difference]: Finished difference Result 14563 states and 18644 transitions. [2025-01-09 06:03:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:03:51,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 69 [2025-01-09 06:03:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:51,900 INFO L225 Difference]: With dead ends: 14563 [2025-01-09 06:03:51,900 INFO L226 Difference]: Without dead ends: 14560 [2025-01-09 06:03:51,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:03:51,912 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 858 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:51,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1637 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:03:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14560 states. [2025-01-09 06:03:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14560 to 13246. [2025-01-09 06:03:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13246 states, 10139 states have (on average 1.2699477266002563) internal successors, (12876), 10350 states have internal predecessors, (12876), 1487 states have call successors, (1487), 1277 states have call predecessors, (1487), 1618 states have return successors, (2652), 1622 states have call predecessors, (2652), 1486 states have call successors, (2652) [2025-01-09 06:03:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13246 states to 13246 states and 17015 transitions. [2025-01-09 06:03:52,779 INFO L78 Accepts]: Start accepts. Automaton has 13246 states and 17015 transitions. Word has length 69 [2025-01-09 06:03:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 13246 states and 17015 transitions. [2025-01-09 06:03:52,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:03:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 13246 states and 17015 transitions. [2025-01-09 06:03:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:03:52,782 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:52,782 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-01-09 06:03:52,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 06:03:52,987 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-01-09 06:03:52,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:52,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1580096507, now seen corresponding path program 1 times [2025-01-09 06:03:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:52,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984114338] [2025-01-09 06:03:52,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:52,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:03:53,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:03:53,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:53,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:53,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:53,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984114338] [2025-01-09 06:03:53,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984114338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:53,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:53,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:03:53,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106450182] [2025-01-09 06:03:53,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:53,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:03:53,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:53,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:03:53,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:03:53,060 INFO L87 Difference]: Start difference. First operand 13246 states and 17015 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:54,300 INFO L93 Difference]: Finished difference Result 13484 states and 17369 transitions. [2025-01-09 06:03:54,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:03:54,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-01-09 06:03:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:54,370 INFO L225 Difference]: With dead ends: 13484 [2025-01-09 06:03:54,370 INFO L226 Difference]: Without dead ends: 13369 [2025-01-09 06:03:54,382 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-01-09 06:03:54,383 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 461 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:54,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 632 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:03:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13369 states. [2025-01-09 06:03:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13369 to 13360. [2025-01-09 06:03:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13360 states, 10235 states have (on average 1.2721055202735712) internal successors, (13020), 10447 states have internal predecessors, (13020), 1498 states have call successors, (1498), 1283 states have call predecessors, (1498), 1625 states have return successors, (2664), 1633 states have call predecessors, (2664), 1497 states have call successors, (2664) [2025-01-09 06:03:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13360 states to 13360 states and 17182 transitions. [2025-01-09 06:03:55,456 INFO L78 Accepts]: Start accepts. Automaton has 13360 states and 17182 transitions. Word has length 66 [2025-01-09 06:03:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:55,457 INFO L471 AbstractCegarLoop]: Abstraction has 13360 states and 17182 transitions. [2025-01-09 06:03:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 13360 states and 17182 transitions. [2025-01-09 06:03:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:03:55,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:55,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:03:55,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:03:55,461 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:55,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1136195833, now seen corresponding path program 1 times [2025-01-09 06:03:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:55,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901783195] [2025-01-09 06:03:55,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:55,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:03:55,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:03:55,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:55,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:55,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:55,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901783195] [2025-01-09 06:03:55,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901783195] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:55,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:55,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:55,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86249269] [2025-01-09 06:03:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:55,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:55,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:55,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:55,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:55,545 INFO L87 Difference]: Start difference. First operand 13360 states and 17182 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:56,618 INFO L93 Difference]: Finished difference Result 13729 states and 17728 transitions. [2025-01-09 06:03:56,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:56,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-01-09 06:03:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:56,677 INFO L225 Difference]: With dead ends: 13729 [2025-01-09 06:03:56,677 INFO L226 Difference]: Without dead ends: 13500 [2025-01-09 06:03:56,687 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-01-09 06:03:56,688 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 451 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:56,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1071 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:03:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13500 states. [2025-01-09 06:03:57,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13500 to 13467. [2025-01-09 06:03:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13467 states, 10324 states have (on average 1.2737311119721038) internal successors, (13150), 10537 states have internal predecessors, (13150), 1509 states have call successors, (1509), 1289 states have call predecessors, (1509), 1632 states have return successors, (2678), 1645 states have call predecessors, (2678), 1508 states have call successors, (2678) [2025-01-09 06:03:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13467 states to 13467 states and 17337 transitions. [2025-01-09 06:03:57,597 INFO L78 Accepts]: Start accepts. Automaton has 13467 states and 17337 transitions. Word has length 66 [2025-01-09 06:03:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:03:57,598 INFO L471 AbstractCegarLoop]: Abstraction has 13467 states and 17337 transitions. [2025-01-09 06:03:57,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13467 states and 17337 transitions. [2025-01-09 06:03:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:03:57,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:03:57,600 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-01-09 06:03:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:03:57,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:03:57,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:03:57,600 INFO L85 PathProgramCache]: Analyzing trace with hash 402144197, now seen corresponding path program 1 times [2025-01-09 06:03:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:03:57,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031693940] [2025-01-09 06:03:57,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:03:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:03:57,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:03:57,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:03:57,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:03:57,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:03:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:03:57,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:03:57,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031693940] [2025-01-09 06:03:57,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031693940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:03:57,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:03:57,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:03:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620049779] [2025-01-09 06:03:57,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:03:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:03:57,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:03:57,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:03:57,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:03:57,670 INFO L87 Difference]: Start difference. First operand 13467 states and 17337 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:03:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:03:59,254 INFO L93 Difference]: Finished difference Result 14090 states and 18251 transitions. [2025-01-09 06:03:59,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:03:59,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-01-09 06:03:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:03:59,317 INFO L225 Difference]: With dead ends: 14090 [2025-01-09 06:03:59,317 INFO L226 Difference]: Without dead ends: 13754 [2025-01-09 06:03:59,326 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-01-09 06:03:59,327 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 466 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:03:59,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1028 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:03:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13754 states. [2025-01-09 06:04:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13754 to 13681. [2025-01-09 06:04:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13681 states, 10502 states have (on average 1.2769948581222623) internal successors, (13411), 10719 states have internal predecessors, (13411), 1529 states have call successors, (1529), 1301 states have call predecessors, (1529), 1648 states have return successors, (2710), 1667 states have call predecessors, (2710), 1528 states have call successors, (2710) [2025-01-09 06:04:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13681 states to 13681 states and 17650 transitions. [2025-01-09 06:04:00,828 INFO L78 Accepts]: Start accepts. Automaton has 13681 states and 17650 transitions. Word has length 66 [2025-01-09 06:04:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:00,829 INFO L471 AbstractCegarLoop]: Abstraction has 13681 states and 17650 transitions. [2025-01-09 06:04:00,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 13681 states and 17650 transitions. [2025-01-09 06:04:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:04:00,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:00,831 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-01-09 06:04:00,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:04:00,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:00,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -78936061, now seen corresponding path program 1 times [2025-01-09 06:04:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:00,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155797196] [2025-01-09 06:04:00,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:00,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:04:00,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:04:00,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:00,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:00,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:00,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155797196] [2025-01-09 06:04:00,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155797196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:00,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:00,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:00,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088411690] [2025-01-09 06:04:00,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:00,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:00,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:00,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:00,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:00,908 INFO L87 Difference]: Start difference. First operand 13681 states and 17650 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:02,080 INFO L93 Difference]: Finished difference Result 14754 states and 19234 transitions. [2025-01-09 06:04:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-01-09 06:04:02,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:02,141 INFO L225 Difference]: With dead ends: 14754 [2025-01-09 06:04:02,142 INFO L226 Difference]: Without dead ends: 14204 [2025-01-09 06:04:02,152 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-01-09 06:04:02,153 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 481 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:02,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1012 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:04:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14204 states. [2025-01-09 06:04:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14204 to 14102. [2025-01-09 06:04:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14102 states, 10847 states have (on average 1.2824744168894626) internal successors, (13911), 11078 states have internal predecessors, (13911), 1567 states have call successors, (1567), 1325 states have call predecessors, (1567), 1686 states have return successors, (2796), 1709 states have call predecessors, (2796), 1566 states have call successors, (2796) [2025-01-09 06:04:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14102 states to 14102 states and 18274 transitions. [2025-01-09 06:04:03,208 INFO L78 Accepts]: Start accepts. Automaton has 14102 states and 18274 transitions. Word has length 66 [2025-01-09 06:04:03,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:03,209 INFO L471 AbstractCegarLoop]: Abstraction has 14102 states and 18274 transitions. [2025-01-09 06:04:03,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:03,209 INFO L276 IsEmpty]: Start isEmpty. Operand 14102 states and 18274 transitions. [2025-01-09 06:04:03,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:04:03,211 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:03,211 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-01-09 06:04:03,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:04:03,211 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:03,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash -94454779, now seen corresponding path program 1 times [2025-01-09 06:04:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:03,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989822910] [2025-01-09 06:04:03,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:03,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:04:03,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:04:03,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:03,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:03,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989822910] [2025-01-09 06:04:03,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989822910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:03,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:03,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:03,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096197242] [2025-01-09 06:04:03,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:03,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:03,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:03,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:03,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:03,293 INFO L87 Difference]: Start difference. First operand 14102 states and 18274 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:04,582 INFO L93 Difference]: Finished difference Result 16031 states and 21176 transitions. [2025-01-09 06:04:04,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:04:04,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-01-09 06:04:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:04,642 INFO L225 Difference]: With dead ends: 16031 [2025-01-09 06:04:04,643 INFO L226 Difference]: Without dead ends: 15060 [2025-01-09 06:04:04,655 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-01-09 06:04:04,655 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 436 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:04,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1004 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:04:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15060 states. [2025-01-09 06:04:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15060 to 14969. [2025-01-09 06:04:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14969 states, 11552 states have (on average 1.2919840720221607) internal successors, (14925), 11829 states have internal predecessors, (14925), 1637 states have call successors, (1637), 1371 states have call predecessors, (1637), 1778 states have return successors, (3058), 1787 states have call predecessors, (3058), 1636 states have call successors, (3058) [2025-01-09 06:04:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14969 states to 14969 states and 19620 transitions. [2025-01-09 06:04:05,814 INFO L78 Accepts]: Start accepts. Automaton has 14969 states and 19620 transitions. Word has length 66 [2025-01-09 06:04:05,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:05,814 INFO L471 AbstractCegarLoop]: Abstraction has 14969 states and 19620 transitions. [2025-01-09 06:04:05,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 14969 states and 19620 transitions. [2025-01-09 06:04:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:04:05,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:05,817 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-01-09 06:04:05,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:04:05,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:05,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1844707267, now seen corresponding path program 1 times [2025-01-09 06:04:05,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:05,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248094662] [2025-01-09 06:04:05,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:05,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:05,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:04:05,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:04:05,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:05,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:05,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:05,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248094662] [2025-01-09 06:04:05,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248094662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:05,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:05,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:05,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867044530] [2025-01-09 06:04:05,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:05,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:05,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:05,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:05,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:05,858 INFO L87 Difference]: Start difference. First operand 14969 states and 19620 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:07,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:07,168 INFO L93 Difference]: Finished difference Result 16857 states and 22520 transitions. [2025-01-09 06:04:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:04:07,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-01-09 06:04:07,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:07,233 INFO L225 Difference]: With dead ends: 16857 [2025-01-09 06:04:07,233 INFO L226 Difference]: Without dead ends: 15020 [2025-01-09 06:04:07,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:07,248 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 0 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:07,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1214 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:07,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15020 states. [2025-01-09 06:04:08,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15020 to 15020. [2025-01-09 06:04:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15020 states, 11603 states have (on average 1.2907006808583987) internal successors, (14976), 11880 states have internal predecessors, (14976), 1637 states have call successors, (1637), 1371 states have call predecessors, (1637), 1778 states have return successors, (3058), 1787 states have call predecessors, (3058), 1636 states have call successors, (3058) [2025-01-09 06:04:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15020 states to 15020 states and 19671 transitions. [2025-01-09 06:04:09,081 INFO L78 Accepts]: Start accepts. Automaton has 15020 states and 19671 transitions. Word has length 66 [2025-01-09 06:04:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:09,084 INFO L471 AbstractCegarLoop]: Abstraction has 15020 states and 19671 transitions. [2025-01-09 06:04:09,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 15020 states and 19671 transitions. [2025-01-09 06:04:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:04:09,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:09,092 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-01-09 06:04:09,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:04:09,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:09,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash -659899, now seen corresponding path program 1 times [2025-01-09 06:04:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:09,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373998762] [2025-01-09 06:04:09,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:09,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:04:09,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:04:09,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:09,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:09,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:09,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373998762] [2025-01-09 06:04:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373998762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:09,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:04:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340334288] [2025-01-09 06:04:09,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:09,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:04:09,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:09,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:04:09,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:04:09,175 INFO L87 Difference]: Start difference. First operand 15020 states and 19671 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:10,558 INFO L93 Difference]: Finished difference Result 21660 states and 29799 transitions. [2025-01-09 06:04:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:04:10,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-01-09 06:04:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:10,631 INFO L225 Difference]: With dead ends: 21660 [2025-01-09 06:04:10,631 INFO L226 Difference]: Without dead ends: 19772 [2025-01-09 06:04:10,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:10,650 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 979 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:10,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 928 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:04:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19772 states. [2025-01-09 06:04:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19772 to 19469. [2025-01-09 06:04:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19469 states, 15249 states have (on average 1.3221850613154962) internal successors, (20162), 15679 states have internal predecessors, (20162), 2054 states have call successors, (2054), 1631 states have call predecessors, (2054), 2164 states have return successors, (4029), 2177 states have call predecessors, (4029), 2053 states have call successors, (4029) [2025-01-09 06:04:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19469 states to 19469 states and 26245 transitions. [2025-01-09 06:04:12,690 INFO L78 Accepts]: Start accepts. Automaton has 19469 states and 26245 transitions. Word has length 66 [2025-01-09 06:04:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:12,691 INFO L471 AbstractCegarLoop]: Abstraction has 19469 states and 26245 transitions. [2025-01-09 06:04:12,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:04:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 19469 states and 26245 transitions. [2025-01-09 06:04:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:04:12,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:12,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:12,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:04:12,694 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:12,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1902296659, now seen corresponding path program 2 times [2025-01-09 06:04:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:12,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907171092] [2025-01-09 06:04:12,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:04:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:12,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 06:04:12,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:04:12,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 06:04:12,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:04:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907171092] [2025-01-09 06:04:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907171092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:12,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:12,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:04:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524166187] [2025-01-09 06:04:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:12,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:12,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:12,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:12,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:04:12,719 INFO L87 Difference]: Start difference. First operand 19469 states and 26245 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:13,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:13,833 INFO L93 Difference]: Finished difference Result 26259 states and 35062 transitions. [2025-01-09 06:04:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:04:13,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-01-09 06:04:13,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:13,889 INFO L225 Difference]: With dead ends: 26259 [2025-01-09 06:04:13,889 INFO L226 Difference]: Without dead ends: 13587 [2025-01-09 06:04:13,920 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-01-09 06:04:13,920 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 280 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:13,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 491 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:04:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13587 states. [2025-01-09 06:04:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13587 to 13489. [2025-01-09 06:04:14,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13489 states, 10686 states have (on average 1.3306195021523488) internal successors, (14219), 11014 states have internal predecessors, (14219), 1388 states have call successors, (1388), 1053 states have call predecessors, (1388), 1413 states have return successors, (2743), 1440 states have call predecessors, (2743), 1387 states have call successors, (2743) [2025-01-09 06:04:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13489 states to 13489 states and 18350 transitions. [2025-01-09 06:04:14,758 INFO L78 Accepts]: Start accepts. Automaton has 13489 states and 18350 transitions. Word has length 71 [2025-01-09 06:04:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:14,758 INFO L471 AbstractCegarLoop]: Abstraction has 13489 states and 18350 transitions. [2025-01-09 06:04:14,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:04:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 13489 states and 18350 transitions. [2025-01-09 06:04:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 06:04:14,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:14,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:14,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:04:14,764 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:14,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:14,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1081821686, now seen corresponding path program 1 times [2025-01-09 06:04:14,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:14,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170921358] [2025-01-09 06:04:14,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:14,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:14,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 06:04:14,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 06:04:14,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:14,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 06:04:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170921358] [2025-01-09 06:04:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170921358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:04:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872538945] [2025-01-09 06:04:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:14,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:04:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:14,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:04:14,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:14,849 INFO L87 Difference]: Start difference. First operand 13489 states and 18350 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:16,762 INFO L93 Difference]: Finished difference Result 27807 states and 36387 transitions. [2025-01-09 06:04:16,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 06:04:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-01-09 06:04:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:16,850 INFO L225 Difference]: With dead ends: 27807 [2025-01-09 06:04:16,851 INFO L226 Difference]: Without dead ends: 20685 [2025-01-09 06:04:16,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 06:04:16,876 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 570 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:16,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 975 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:04:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20685 states. [2025-01-09 06:04:18,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20685 to 20058. [2025-01-09 06:04:18,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20058 states, 15635 states have (on average 1.2845538855132714) internal successors, (20084), 16095 states have internal predecessors, (20084), 2155 states have call successors, (2155), 1711 states have call predecessors, (2155), 2266 states have return successors, (4230), 2273 states have call predecessors, (4230), 2154 states have call successors, (4230) [2025-01-09 06:04:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20058 states to 20058 states and 26469 transitions. [2025-01-09 06:04:18,207 INFO L78 Accepts]: Start accepts. Automaton has 20058 states and 26469 transitions. Word has length 80 [2025-01-09 06:04:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:18,208 INFO L471 AbstractCegarLoop]: Abstraction has 20058 states and 26469 transitions. [2025-01-09 06:04:18,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 20058 states and 26469 transitions. [2025-01-09 06:04:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 06:04:18,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:18,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:04:18,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:04:18,216 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:18,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:18,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1737083254, now seen corresponding path program 1 times [2025-01-09 06:04:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:18,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210588713] [2025-01-09 06:04:18,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:18,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 06:04:18,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 06:04:18,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:18,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 06:04:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:18,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210588713] [2025-01-09 06:04:18,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210588713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:18,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:04:18,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:04:18,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331388868] [2025-01-09 06:04:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:18,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:04:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:18,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:04:18,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:04:18,279 INFO L87 Difference]: Start difference. First operand 20058 states and 26469 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:04:20,005 INFO L93 Difference]: Finished difference Result 30030 states and 38829 transitions. [2025-01-09 06:04:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 06:04:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-01-09 06:04:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:04:20,065 INFO L225 Difference]: With dead ends: 30030 [2025-01-09 06:04:20,066 INFO L226 Difference]: Without dead ends: 18059 [2025-01-09 06:04:20,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 06:04:20,095 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1057 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:04:20,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1024 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:04:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18059 states. [2025-01-09 06:04:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18059 to 17258. [2025-01-09 06:04:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17258 states, 13564 states have (on average 1.2886316720731348) internal successors, (17479), 13938 states have internal predecessors, (17479), 1814 states have call successors, (1814), 1413 states have call predecessors, (1814), 1878 states have return successors, (3398), 1928 states have call predecessors, (3398), 1813 states have call successors, (3398) [2025-01-09 06:04:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17258 states to 17258 states and 22691 transitions. [2025-01-09 06:04:21,369 INFO L78 Accepts]: Start accepts. Automaton has 17258 states and 22691 transitions. Word has length 86 [2025-01-09 06:04:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:04:21,369 INFO L471 AbstractCegarLoop]: Abstraction has 17258 states and 22691 transitions. [2025-01-09 06:04:21,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:04:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 17258 states and 22691 transitions. [2025-01-09 06:04:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 06:04:21,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:04:21,385 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 06:04:21,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:04:21,385 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:04:21,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:04:21,385 INFO L85 PathProgramCache]: Analyzing trace with hash -711891473, now seen corresponding path program 1 times [2025-01-09 06:04:21,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:04:21,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044767980] [2025-01-09 06:04:21,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:04:21,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 06:04:21,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 06:04:21,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:21,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 06:04:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:04:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044767980] [2025-01-09 06:04:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044767980] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:04:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047918375] [2025-01-09 06:04:21,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:04:21,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:04:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:04:21,440 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:04:21,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 06:04:21,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 06:04:21,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 06:04:21,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:04:21,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:04:21,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 06:04:21,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:04:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 06:04:21,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:04:21,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047918375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:04:21,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:04:21,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 06:04:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496382199] [2025-01-09 06:04:21,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:04:21,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:04:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:04:21,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:04:21,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:04:21,545 INFO L87 Difference]: Start difference. First operand 17258 states and 22691 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)