./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.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_3.cil+token_ring.06.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0515a0092ae60bee69c0826328a56fce70547e074096ceb561e2dff3da2ff25f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:06:54,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:06:54,770 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:06:54,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:06:54,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:06:54,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:06:54,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:06:54,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:06:54,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:06:54,814 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:06:54,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:06:54,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:06:54,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:06:54,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:06:54,815 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:06:54,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:06:54,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:06:54,816 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:06:54,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:06:54,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:06:54,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:06:54,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:06:54,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:06:54,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:06:54,817 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:06:54,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:06:54,817 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:06:54,817 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:06:54,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:06:54,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:54,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:54,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:54,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:54,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:06:54,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:54,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:54,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:54,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:54,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:06:54,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:06:54,819 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:06:54,819 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:06:54,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:06:54,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:06:54,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:06:54,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:06:54,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:06:54,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:06:54,820 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 -> 0515a0092ae60bee69c0826328a56fce70547e074096ceb561e2dff3da2ff25f [2025-01-09 06:06:55,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:06:55,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:06:55,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:06:55,135 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:06:55,135 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:06:55,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2025-01-09 06:06:56,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0f81daaa/a27b76a7e7e840f39ca5591f96152916/FLAG1c5ce20a9 [2025-01-09 06:06:56,857 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:06:56,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c [2025-01-09 06:06:56,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0f81daaa/a27b76a7e7e840f39ca5591f96152916/FLAG1c5ce20a9 [2025-01-09 06:06:56,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0f81daaa/a27b76a7e7e840f39ca5591f96152916 [2025-01-09 06:06:56,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:06:56,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:06:56,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:56,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:06:56,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:06:56,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:56" (1/1) ... [2025-01-09 06:06:56,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e9cf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:56, skipping insertion in model container [2025-01-09 06:06:56,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:56" (1/1) ... [2025-01-09 06:06:56,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:06:57,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2025-01-09 06:06:57,145 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2025-01-09 06:06:57,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:57,231 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:06:57,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[911,924] [2025-01-09 06:06:57,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.06.cil-2.c[8416,8429] [2025-01-09 06:06:57,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:57,320 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:06:57,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57 WrapperNode [2025-01-09 06:06:57,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:57,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:57,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:06:57,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:06:57,327 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:06:57" (1/1) ... [2025-01-09 06:06:57,339 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:06:57" (1/1) ... [2025-01-09 06:06:57,389 INFO L138 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 707 [2025-01-09 06:06:57,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:57,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:06:57,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:06:57,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:06:57,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,430 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:06:57,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,441 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:06:57,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:06:57,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:06:57,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:06:57,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (1/1) ... [2025-01-09 06:06:57,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:57,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:57,513 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:06:57,522 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:06:57,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:06:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:06:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:06:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:06:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:06:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:06:57,545 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:06:57,545 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:06:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:06:57,546 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:06:57,546 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:06:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:06:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:06:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:06:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:06:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:06:57,547 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:06:57,547 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:06:57,548 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:06:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:06:57,548 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:06:57,548 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:06:57,549 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:06:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:06:57,549 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:06:57,549 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:06:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:06:57,550 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:06:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:06:57,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:06:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:06:57,550 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:06:57,671 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:06:57,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:06:58,263 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !(1 == ~q_free~0); [2025-01-09 06:06:58,264 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2025-01-09 06:06:58,385 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-01-09 06:06:58,385 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:06:58,410 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:06:58,410 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 06:06:58,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:58 BoogieIcfgContainer [2025-01-09 06:06:58,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:06:58,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:06:58,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:06:58,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:06:58,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:06:56" (1/3) ... [2025-01-09 06:06:58,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b82f178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:58, skipping insertion in model container [2025-01-09 06:06:58,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:57" (2/3) ... [2025-01-09 06:06:58,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b82f178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:58, skipping insertion in model container [2025-01-09 06:06:58,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:58" (3/3) ... [2025-01-09 06:06:58,419 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.06.cil-2.c [2025-01-09 06:06:58,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:06:58,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.06.cil-2.c that has 15 procedures, 343 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-01-09 06:06:58,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:06:58,516 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;@7e49b0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:06:58,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:06:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 343 states, 292 states have (on average 1.5616438356164384) internal successors, (456), 296 states have internal predecessors, (456), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 06:06:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:58,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:58,533 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:06:58,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:58,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:58,537 INFO L85 PathProgramCache]: Analyzing trace with hash -37298697, now seen corresponding path program 1 times [2025-01-09 06:06:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:58,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630558587] [2025-01-09 06:06:58,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:58,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:58,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:58,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:58,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:59,124 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:06:59,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:59,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630558587] [2025-01-09 06:06:59,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630558587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:59,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:59,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:59,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134329835] [2025-01-09 06:06:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:59,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:59,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:59,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:59,151 INFO L87 Difference]: Start difference. First operand has 343 states, 292 states have (on average 1.5616438356164384) internal successors, (456), 296 states have internal predecessors, (456), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:06:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:59,957 INFO L93 Difference]: Finished difference Result 779 states and 1199 transitions. [2025-01-09 06:06:59,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:59,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-01-09 06:06:59,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:59,972 INFO L225 Difference]: With dead ends: 779 [2025-01-09 06:06:59,973 INFO L226 Difference]: Without dead ends: 448 [2025-01-09 06:06:59,977 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:06:59,982 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 396 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:59,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1098 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:07:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-01-09 06:07:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 441. [2025-01-09 06:07:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 368 states have (on average 1.5054347826086956) internal successors, (554), 374 states have internal predecessors, (554), 49 states have call successors, (49), 21 states have call predecessors, (49), 22 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2025-01-09 06:07:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 655 transitions. [2025-01-09 06:07:00,090 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 655 transitions. Word has length 63 [2025-01-09 06:07:00,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:00,094 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 655 transitions. [2025-01-09 06:07:00,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 655 transitions. [2025-01-09 06:07:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:00,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:00,099 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:07:00,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:07:00,100 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:00,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1971150007, now seen corresponding path program 1 times [2025-01-09 06:07:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:00,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139444466] [2025-01-09 06:07:00,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:00,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:00,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:00,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:00,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:00,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:00,325 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:07:00,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:00,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139444466] [2025-01-09 06:07:00,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139444466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:00,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:00,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:00,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194909477] [2025-01-09 06:07:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:00,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:00,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:00,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:00,328 INFO L87 Difference]: Start difference. First operand 441 states and 655 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:01,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:01,223 INFO L93 Difference]: Finished difference Result 796 states and 1158 transitions. [2025-01-09 06:07:01,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:01,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-01-09 06:07:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:01,230 INFO L225 Difference]: With dead ends: 796 [2025-01-09 06:07:01,230 INFO L226 Difference]: Without dead ends: 595 [2025-01-09 06:07:01,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:01,235 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 726 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:01,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1357 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:07:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-01-09 06:07:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 549. [2025-01-09 06:07:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 454 states have (on average 1.4889867841409692) internal successors, (676), 462 states have internal predecessors, (676), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2025-01-09 06:07:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 811 transitions. [2025-01-09 06:07:01,299 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 811 transitions. Word has length 63 [2025-01-09 06:07:01,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:01,299 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 811 transitions. [2025-01-09 06:07:01,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:01,300 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 811 transitions. [2025-01-09 06:07:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:07:01,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:01,302 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:07:01,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:07:01,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:01,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:01,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1955631289, now seen corresponding path program 1 times [2025-01-09 06:07:01,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:01,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075659461] [2025-01-09 06:07:01,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:01,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:01,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:07:01,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:07:01,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:01,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:01,402 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:07:01,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075659461] [2025-01-09 06:07:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075659461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:01,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:01,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:07:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065884908] [2025-01-09 06:07:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:07:01,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:01,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:07:01,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:01,404 INFO L87 Difference]: Start difference. First operand 549 states and 811 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:01,651 INFO L93 Difference]: Finished difference Result 1419 states and 2057 transitions. [2025-01-09 06:07:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:01,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2025-01-09 06:07:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:01,659 INFO L225 Difference]: With dead ends: 1419 [2025-01-09 06:07:01,659 INFO L226 Difference]: Without dead ends: 1116 [2025-01-09 06:07:01,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:01,661 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 594 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:01,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1161 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:07:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-01-09 06:07:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1099. [2025-01-09 06:07:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 894 states have (on average 1.436241610738255) internal successors, (1284), 910 states have internal predecessors, (1284), 122 states have call successors, (122), 70 states have call predecessors, (122), 81 states have return successors, (158), 122 states have call predecessors, (158), 120 states have call successors, (158) [2025-01-09 06:07:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1564 transitions. [2025-01-09 06:07:01,773 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1564 transitions. Word has length 63 [2025-01-09 06:07:01,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:01,773 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1564 transitions. [2025-01-09 06:07:01,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:07:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1564 transitions. [2025-01-09 06:07:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:07:01,779 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:01,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:01,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:07:01,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:01,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:01,782 INFO L85 PathProgramCache]: Analyzing trace with hash -2115998698, now seen corresponding path program 1 times [2025-01-09 06:07:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:01,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708660348] [2025-01-09 06:07:01,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:01,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:01,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:07:01,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:07:01,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:01,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:01,900 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:07:01,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:01,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708660348] [2025-01-09 06:07:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708660348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:01,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:01,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:01,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280136395] [2025-01-09 06:07:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:01,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:01,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:01,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:01,903 INFO L87 Difference]: Start difference. First operand 1099 states and 1564 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:07:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:02,556 INFO L93 Difference]: Finished difference Result 3506 states and 4944 transitions. [2025-01-09 06:07:02,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:07:02,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 64 [2025-01-09 06:07:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:02,565 INFO L225 Difference]: With dead ends: 3506 [2025-01-09 06:07:02,565 INFO L226 Difference]: Without dead ends: 1374 [2025-01-09 06:07:02,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:02,572 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 1500 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:02,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 2120 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-01-09 06:07:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1024. [2025-01-09 06:07:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 819 states have (on average 1.404151404151404) internal successors, (1150), 835 states have internal predecessors, (1150), 122 states have call successors, (122), 70 states have call predecessors, (122), 81 states have return successors, (149), 122 states have call predecessors, (149), 120 states have call successors, (149) [2025-01-09 06:07:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1421 transitions. [2025-01-09 06:07:02,652 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1421 transitions. Word has length 64 [2025-01-09 06:07:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:02,652 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1421 transitions. [2025-01-09 06:07:02,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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:07:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1421 transitions. [2025-01-09 06:07:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:02,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:02,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:02,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:07:02,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:02,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1972465760, now seen corresponding path program 1 times [2025-01-09 06:07:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:02,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997263160] [2025-01-09 06:07:02,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:02,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:02,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:02,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:02,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:02,759 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:07:02,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:02,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997263160] [2025-01-09 06:07:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997263160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:02,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:02,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:02,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536359425] [2025-01-09 06:07:02,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:02,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:02,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:02,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:02,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:02,764 INFO L87 Difference]: Start difference. First operand 1024 states and 1421 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:02,861 INFO L93 Difference]: Finished difference Result 1847 states and 2533 transitions. [2025-01-09 06:07:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:07:02,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-01-09 06:07:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:02,872 INFO L225 Difference]: With dead ends: 1847 [2025-01-09 06:07:02,872 INFO L226 Difference]: Without dead ends: 1069 [2025-01-09 06:07:02,874 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:07:02,875 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 0 mSDsluCounter, 1955 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2445 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:07:02,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-01-09 06:07:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2025-01-09 06:07:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 855 states have (on average 1.3871345029239766) internal successors, (1186), 871 states have internal predecessors, (1186), 122 states have call successors, (122), 70 states have call predecessors, (122), 90 states have return successors, (158), 131 states have call predecessors, (158), 120 states have call successors, (158) [2025-01-09 06:07:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1466 transitions. [2025-01-09 06:07:02,968 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1466 transitions. Word has length 65 [2025-01-09 06:07:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:02,968 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1466 transitions. [2025-01-09 06:07:02,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:07:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1466 transitions. [2025-01-09 06:07:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:02,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:02,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:07:02,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:02,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -399273502, now seen corresponding path program 1 times [2025-01-09 06:07:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:02,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578522985] [2025-01-09 06:07:02,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:02,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:02,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:02,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:02,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:03,123 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:07:03,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:03,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578522985] [2025-01-09 06:07:03,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578522985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:03,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:03,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:03,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700426124] [2025-01-09 06:07:03,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:03,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:03,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:03,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:03,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:03,126 INFO L87 Difference]: Start difference. First operand 1069 states and 1466 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:03,937 INFO L93 Difference]: Finished difference Result 1946 states and 2603 transitions. [2025-01-09 06:07:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 06:07:03,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-01-09 06:07:03,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:03,945 INFO L225 Difference]: With dead ends: 1946 [2025-01-09 06:07:03,945 INFO L226 Difference]: Without dead ends: 1208 [2025-01-09 06:07:03,947 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:07:03,948 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 728 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:03,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 1078 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:07:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2025-01-09 06:07:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1078. [2025-01-09 06:07:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 864 states have (on average 1.3819444444444444) internal successors, (1194), 878 states have internal predecessors, (1194), 123 states have call successors, (123), 71 states have call predecessors, (123), 89 states have return successors, (153), 132 states have call predecessors, (153), 121 states have call successors, (153) [2025-01-09 06:07:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1470 transitions. [2025-01-09 06:07:04,013 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1470 transitions. Word has length 65 [2025-01-09 06:07:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:04,013 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1470 transitions. [2025-01-09 06:07:04,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:07:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1470 transitions. [2025-01-09 06:07:04,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:07:04,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:04,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:04,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:07:04,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:04,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash -180418784, now seen corresponding path program 1 times [2025-01-09 06:07:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:04,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94925566] [2025-01-09 06:07:04,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:04,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:07:04,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:07:04,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:04,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:04,117 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:07:04,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:04,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94925566] [2025-01-09 06:07:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94925566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:04,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:04,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:07:04,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898143484] [2025-01-09 06:07:04,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:04,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:07:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:04,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:07:04,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:04,120 INFO L87 Difference]: Start difference. First operand 1078 states and 1470 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:07:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:04,602 INFO L93 Difference]: Finished difference Result 2764 states and 3737 transitions. [2025-01-09 06:07:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:07:04,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 65 [2025-01-09 06:07:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:04,616 INFO L225 Difference]: With dead ends: 2764 [2025-01-09 06:07:04,617 INFO L226 Difference]: Without dead ends: 1935 [2025-01-09 06:07:04,619 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:07:04,621 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 682 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:04,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 549 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:07:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2025-01-09 06:07:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1925. [2025-01-09 06:07:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1509 states have (on average 1.337972166998012) internal successors, (2019), 1537 states have internal predecessors, (2019), 233 states have call successors, (233), 135 states have call predecessors, (233), 181 states have return successors, (351), 259 states have call predecessors, (351), 231 states have call successors, (351) [2025-01-09 06:07:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2603 transitions. [2025-01-09 06:07:04,743 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2603 transitions. Word has length 65 [2025-01-09 06:07:04,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:04,744 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 2603 transitions. [2025-01-09 06:07:04,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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:07:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2603 transitions. [2025-01-09 06:07:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 06:07:04,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:04,747 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:07:04,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:07:04,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash 556170623, now seen corresponding path program 1 times [2025-01-09 06:07:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:04,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422458987] [2025-01-09 06:07:04,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:04,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 06:07:04,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 06:07:04,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:04,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:04,783 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:07:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422458987] [2025-01-09 06:07:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422458987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:04,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:07:04,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541935910] [2025-01-09 06:07:04,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:04,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:07:04,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:04,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:07:04,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:07:04,785 INFO L87 Difference]: Start difference. First operand 1925 states and 2603 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:07:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:04,887 INFO L93 Difference]: Finished difference Result 3455 states and 4724 transitions. [2025-01-09 06:07:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:07:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 66 [2025-01-09 06:07:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:04,891 INFO L225 Difference]: With dead ends: 3455 [2025-01-09 06:07:04,891 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 06:07:04,898 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:07:04,898 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 460 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:04,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 477 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 06:07:04,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-01-09 06:07:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 200 states have internal predecessors, (308), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 06:07:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 348 transitions. [2025-01-09 06:07:04,911 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 348 transitions. Word has length 66 [2025-01-09 06:07:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:04,911 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 348 transitions. [2025-01-09 06:07:04,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:07:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 348 transitions. [2025-01-09 06:07:04,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:07:04,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:04,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:04,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:07:04,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:04,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:04,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1885013901, now seen corresponding path program 1 times [2025-01-09 06:07:04,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:04,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846566288] [2025-01-09 06:07:04,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:04,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:04,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:07:04,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:07:04,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:04,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:05,052 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:07:05,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846566288] [2025-01-09 06:07:05,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846566288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178952880] [2025-01-09 06:07:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:05,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:05,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:05,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:05,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:05,054 INFO L87 Difference]: Start difference. First operand 226 states and 348 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:05,611 INFO L93 Difference]: Finished difference Result 688 states and 1081 transitions. [2025-01-09 06:07:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:05,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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 110 [2025-01-09 06:07:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:05,616 INFO L225 Difference]: With dead ends: 688 [2025-01-09 06:07:05,616 INFO L226 Difference]: Without dead ends: 477 [2025-01-09 06:07:05,617 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:07:05,617 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 638 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:05,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1754 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-01-09 06:07:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 447. [2025-01-09 06:07:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 395 states have (on average 1.5620253164556963) internal successors, (617), 398 states have internal predecessors, (617), 37 states have call successors, (37), 12 states have call predecessors, (37), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2025-01-09 06:07:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 698 transitions. [2025-01-09 06:07:05,647 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 698 transitions. Word has length 110 [2025-01-09 06:07:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:05,648 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 698 transitions. [2025-01-09 06:07:05,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 698 transitions. [2025-01-09 06:07:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:07:05,649 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:05,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:05,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:07:05,650 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:05,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:05,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1856513611, now seen corresponding path program 1 times [2025-01-09 06:07:05,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:05,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324828206] [2025-01-09 06:07:05,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:05,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:05,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:07:05,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:07:05,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:05,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:05,780 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:07:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324828206] [2025-01-09 06:07:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324828206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268950596] [2025-01-09 06:07:05,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:05,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:05,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:05,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:05,782 INFO L87 Difference]: Start difference. First operand 447 states and 698 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:06,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:06,314 INFO L93 Difference]: Finished difference Result 1350 states and 2130 transitions. [2025-01-09 06:07:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:06,315 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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 110 [2025-01-09 06:07:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:06,321 INFO L225 Difference]: With dead ends: 1350 [2025-01-09 06:07:06,322 INFO L226 Difference]: Without dead ends: 920 [2025-01-09 06:07:06,323 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:07:06,324 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 633 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:06,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1846 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-01-09 06:07:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 879. [2025-01-09 06:07:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 781 states have (on average 1.5646606914212549) internal successors, (1222), 788 states have internal predecessors, (1222), 67 states have call successors, (67), 24 states have call predecessors, (67), 30 states have return successors, (90), 70 states have call predecessors, (90), 67 states have call successors, (90) [2025-01-09 06:07:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1379 transitions. [2025-01-09 06:07:06,378 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1379 transitions. Word has length 110 [2025-01-09 06:07:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:06,378 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1379 transitions. [2025-01-09 06:07:06,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1379 transitions. [2025-01-09 06:07:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:07:06,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:06,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:06,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:07:06,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:06,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -84068403, now seen corresponding path program 1 times [2025-01-09 06:07:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:06,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318767057] [2025-01-09 06:07:06,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:06,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:07:06,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:07:06,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:06,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:06,522 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:07:06,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:06,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318767057] [2025-01-09 06:07:06,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318767057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:06,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:06,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767044450] [2025-01-09 06:07:06,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:06,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:06,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:06,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:06,524 INFO L87 Difference]: Start difference. First operand 879 states and 1379 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:07,096 INFO L93 Difference]: Finished difference Result 2735 states and 4357 transitions. [2025-01-09 06:07:07,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:07,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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 110 [2025-01-09 06:07:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:07,106 INFO L225 Difference]: With dead ends: 2735 [2025-01-09 06:07:07,106 INFO L226 Difference]: Without dead ends: 1873 [2025-01-09 06:07:07,109 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:07:07,110 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 628 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:07,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1830 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-01-09 06:07:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1811. [2025-01-09 06:07:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1615 states have (on average 1.5777089783281735) internal successors, (2548), 1636 states have internal predecessors, (2548), 127 states have call successors, (127), 48 states have call predecessors, (127), 68 states have return successors, (206), 134 states have call predecessors, (206), 127 states have call successors, (206) [2025-01-09 06:07:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2881 transitions. [2025-01-09 06:07:07,200 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2881 transitions. Word has length 110 [2025-01-09 06:07:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:07,200 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2881 transitions. [2025-01-09 06:07:07,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2881 transitions. [2025-01-09 06:07:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:07:07,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:07,204 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:07,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:07:07,204 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:07,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:07,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1792994827, now seen corresponding path program 1 times [2025-01-09 06:07:07,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:07,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140265370] [2025-01-09 06:07:07,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:07,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:07,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:07:07,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:07:07,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:07,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:07,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:07,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140265370] [2025-01-09 06:07:07,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140265370] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:07,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:07,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:07,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005559082] [2025-01-09 06:07:07,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:07,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:07,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:07,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:07,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:07,330 INFO L87 Difference]: Start difference. First operand 1811 states and 2881 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:07,964 INFO L93 Difference]: Finished difference Result 5758 states and 9359 transitions. [2025-01-09 06:07:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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 110 [2025-01-09 06:07:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:07,991 INFO L225 Difference]: With dead ends: 5758 [2025-01-09 06:07:07,992 INFO L226 Difference]: Without dead ends: 3964 [2025-01-09 06:07:07,998 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:07:07,999 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 623 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:07,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1816 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-01-09 06:07:08,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3863. [2025-01-09 06:07:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3453 states have (on average 1.598030697943817) internal successors, (5518), 3520 states have internal predecessors, (5518), 247 states have call successors, (247), 96 states have call predecessors, (247), 162 states have return successors, (534), 262 states have call predecessors, (534), 247 states have call successors, (534) [2025-01-09 06:07:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 6299 transitions. [2025-01-09 06:07:08,211 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 6299 transitions. Word has length 110 [2025-01-09 06:07:08,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:08,212 INFO L471 AbstractCegarLoop]: Abstraction has 3863 states and 6299 transitions. [2025-01-09 06:07:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 6299 transitions. [2025-01-09 06:07:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:07:08,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:08,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:08,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:07:08,217 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:08,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:08,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1022261261, now seen corresponding path program 1 times [2025-01-09 06:07:08,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:08,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802261233] [2025-01-09 06:07:08,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:08,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:08,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:07:08,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:07:08,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:08,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:08,372 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:07:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802261233] [2025-01-09 06:07:08,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802261233] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:08,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599449040] [2025-01-09 06:07:08,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:08,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:08,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:08,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:08,375 INFO L87 Difference]: Start difference. First operand 3863 states and 6299 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:09,213 INFO L93 Difference]: Finished difference Result 12497 states and 21001 transitions. [2025-01-09 06:07:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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 110 [2025-01-09 06:07:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:09,268 INFO L225 Difference]: With dead ends: 12497 [2025-01-09 06:07:09,272 INFO L226 Difference]: Without dead ends: 8651 [2025-01-09 06:07:09,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:07:09,289 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 618 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:09,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1804 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8651 states. [2025-01-09 06:07:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8651 to 8479. [2025-01-09 06:07:09,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8479 states, 7587 states have (on average 1.6227758007117439) internal successors, (12312), 7800 states have internal predecessors, (12312), 487 states have call successors, (487), 192 states have call predecessors, (487), 404 states have return successors, (1574), 518 states have call predecessors, (1574), 487 states have call successors, (1574) [2025-01-09 06:07:09,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8479 states to 8479 states and 14373 transitions. [2025-01-09 06:07:09,857 INFO L78 Accepts]: Start accepts. Automaton has 8479 states and 14373 transitions. Word has length 110 [2025-01-09 06:07:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:09,857 INFO L471 AbstractCegarLoop]: Abstraction has 8479 states and 14373 transitions. [2025-01-09 06:07:09,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 8479 states and 14373 transitions. [2025-01-09 06:07:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:07:09,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:09,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:09,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:07:09,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:09,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 27567563, now seen corresponding path program 1 times [2025-01-09 06:07:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737359448] [2025-01-09 06:07:09,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:09,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:07:09,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:07:09,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:09,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:10,010 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:07:10,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:10,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737359448] [2025-01-09 06:07:10,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737359448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:10,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:10,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246068861] [2025-01-09 06:07:10,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:10,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:10,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:10,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:10,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:10,013 INFO L87 Difference]: Start difference. First operand 8479 states and 14373 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:11,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:11,342 INFO L93 Difference]: Finished difference Result 27848 states and 49279 transitions. [2025-01-09 06:07:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:11,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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 110 [2025-01-09 06:07:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:11,455 INFO L225 Difference]: With dead ends: 27848 [2025-01-09 06:07:11,455 INFO L226 Difference]: Without dead ends: 19386 [2025-01-09 06:07:11,481 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:07:11,482 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 613 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:11,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1788 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19386 states. [2025-01-09 06:07:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19386 to 19087. [2025-01-09 06:07:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19087 states, 17069 states have (on average 1.649188587497803) internal successors, (28150), 17736 states have internal predecessors, (28150), 967 states have call successors, (967), 384 states have call predecessors, (967), 1050 states have return successors, (5190), 1030 states have call predecessors, (5190), 967 states have call successors, (5190) [2025-01-09 06:07:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19087 states to 19087 states and 34307 transitions. [2025-01-09 06:07:12,842 INFO L78 Accepts]: Start accepts. Automaton has 19087 states and 34307 transitions. Word has length 110 [2025-01-09 06:07:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:12,843 INFO L471 AbstractCegarLoop]: Abstraction has 19087 states and 34307 transitions. [2025-01-09 06:07:12,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 19087 states and 34307 transitions. [2025-01-09 06:07:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:07:12,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:12,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:12,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:07:12,860 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:12,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash -558708659, now seen corresponding path program 1 times [2025-01-09 06:07:12,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:12,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925578758] [2025-01-09 06:07:12,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:12,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:07:12,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:07:12,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:12,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:13,018 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:07:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:13,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925578758] [2025-01-09 06:07:13,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925578758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:13,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:13,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731135386] [2025-01-09 06:07:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:13,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:13,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:13,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:13,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:13,021 INFO L87 Difference]: Start difference. First operand 19087 states and 34307 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:15,565 INFO L93 Difference]: Finished difference Result 66547 states and 126046 transitions. [2025-01-09 06:07:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:15,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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 110 [2025-01-09 06:07:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:15,855 INFO L225 Difference]: With dead ends: 66547 [2025-01-09 06:07:15,856 INFO L226 Difference]: Without dead ends: 47477 [2025-01-09 06:07:15,939 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:07:15,939 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 671 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:15,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1768 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:07:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47477 states. [2025-01-09 06:07:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47477 to 43755. [2025-01-09 06:07:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43755 states, 39063 states have (on average 1.6766761385454265) internal successors, (65496), 41124 states have internal predecessors, (65496), 1863 states have call successors, (1863), 768 states have call predecessors, (1863), 2828 states have return successors, (18502), 1990 states have call predecessors, (18502), 1863 states have call successors, (18502) [2025-01-09 06:07:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43755 states to 43755 states and 85861 transitions. [2025-01-09 06:07:19,380 INFO L78 Accepts]: Start accepts. Automaton has 43755 states and 85861 transitions. Word has length 110 [2025-01-09 06:07:19,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:19,381 INFO L471 AbstractCegarLoop]: Abstraction has 43755 states and 85861 transitions. [2025-01-09 06:07:19,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 43755 states and 85861 transitions. [2025-01-09 06:07:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:07:19,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:19,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:19,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:07:19,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:19,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1777683851, now seen corresponding path program 1 times [2025-01-09 06:07:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:19,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519761225] [2025-01-09 06:07:19,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:19,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:19,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:07:19,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:07:19,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:19,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:19,525 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:07:19,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:19,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519761225] [2025-01-09 06:07:19,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519761225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:19,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:19,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709427269] [2025-01-09 06:07:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:19,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:19,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:19,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:19,527 INFO L87 Difference]: Start difference. First operand 43755 states and 85861 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:24,395 INFO L93 Difference]: Finished difference Result 149311 states and 317918 transitions. [2025-01-09 06:07:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:07:24,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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 110 [2025-01-09 06:07:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:25,063 INFO L225 Difference]: With dead ends: 149311 [2025-01-09 06:07:25,063 INFO L226 Difference]: Without dead ends: 105573 [2025-01-09 06:07:25,184 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:07:25,185 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 644 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:25,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1611 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:07:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105573 states. [2025-01-09 06:07:32,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105573 to 100189. [2025-01-09 06:07:32,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100189 states, 88755 states have (on average 1.692321559348769) internal successors, (150202), 95062 states have internal predecessors, (150202), 3591 states have call successors, (3591), 1536 states have call predecessors, (3591), 7842 states have return successors, (69638), 3846 states have call predecessors, (69638), 3591 states have call successors, (69638) [2025-01-09 06:07:33,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100189 states to 100189 states and 223431 transitions. [2025-01-09 06:07:33,035 INFO L78 Accepts]: Start accepts. Automaton has 100189 states and 223431 transitions. Word has length 110 [2025-01-09 06:07:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:33,035 INFO L471 AbstractCegarLoop]: Abstraction has 100189 states and 223431 transitions. [2025-01-09 06:07:33,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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:07:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 100189 states and 223431 transitions. [2025-01-09 06:07:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 06:07:33,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:33,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:07:33,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:07:33,095 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:33,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash -101447095, now seen corresponding path program 1 times [2025-01-09 06:07:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:33,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195099076] [2025-01-09 06:07:33,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:33,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 06:07:33,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 06:07:33,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:33,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:33,227 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:07:33,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:33,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195099076] [2025-01-09 06:07:33,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195099076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:33,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:33,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:07:33,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005646271] [2025-01-09 06:07:33,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:33,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:07:33,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:33,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:07:33,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:07:33,232 INFO L87 Difference]: Start difference. First operand 100189 states and 223431 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 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)