./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37139db5f2012b0b7a96ab437e26855d856636bc4064d013c0b416905ff6e54c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:06:31,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:06:31,416 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:31,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:06:31,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:06:31,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:06:31,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:06:31,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:06:31,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:06:31,441 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:06:31,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:06:31,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:06:31,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:06:31,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:06:31,442 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:06:31,442 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:06:31,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:06:31,442 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:06:31,443 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:31,443 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:31,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:31,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:31,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:06:31,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:06:31,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:06:31,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:06:31,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:31,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:06:31,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:06:31,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:06:31,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:06:31,445 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:06:31,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:06:31,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:06:31,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:06:31,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:06:31,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:06:31,446 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 -> 37139db5f2012b0b7a96ab437e26855d856636bc4064d013c0b416905ff6e54c [2025-01-09 06:06:31,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:06:31,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:06:31,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:06:31,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:06:31,668 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:06:31,669 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.04.cil-1.c [2025-01-09 06:06:32,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d68a670f/b2f48915e70a40dba1eb5d266f637e24/FLAG73b0502eb [2025-01-09 06:06:34,181 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:06:34,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.04.cil-1.c [2025-01-09 06:06:34,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d68a670f/b2f48915e70a40dba1eb5d266f637e24/FLAG73b0502eb [2025-01-09 06:06:34,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d68a670f/b2f48915e70a40dba1eb5d266f637e24 [2025-01-09 06:06:34,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:06:34,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:06:34,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:34,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:06:34,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:06:34,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:34,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3febd2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34, skipping insertion in model container [2025-01-09 06:06:34,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:34,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:06:34,482 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.04.cil-1.c[911,924] [2025-01-09 06:06:34,534 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.04.cil-1.c[8416,8429] [2025-01-09 06:06:34,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:34,595 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:06:34,604 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.04.cil-1.c[911,924] [2025-01-09 06:06:34,628 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.04.cil-1.c[8416,8429] [2025-01-09 06:06:34,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:06:34,681 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:06:34,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34 WrapperNode [2025-01-09 06:06:34,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:06:34,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:34,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:06:34,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:06:34,688 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:34" (1/1) ... [2025-01-09 06:06:34,694 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:34" (1/1) ... [2025-01-09 06:06:34,719 INFO L138 Inliner]: procedures = 63, calls = 73, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 593 [2025-01-09 06:06:34,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:06:34,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:06:34,723 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:06:34,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:06:34,733 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:34" (1/1) ... [2025-01-09 06:06:34,733 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:34" (1/1) ... [2025-01-09 06:06:34,738 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:34" (1/1) ... [2025-01-09 06:06:34,759 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:34,761 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:34" (1/1) ... [2025-01-09 06:06:34,761 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:34" (1/1) ... [2025-01-09 06:06:34,768 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:34" (1/1) ... [2025-01-09 06:06:34,774 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:34" (1/1) ... [2025-01-09 06:06:34,785 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:34" (1/1) ... [2025-01-09 06:06:34,788 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:34" (1/1) ... [2025-01-09 06:06:34,789 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:34" (1/1) ... [2025-01-09 06:06:34,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:06:34,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:06:34,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:06:34,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:06:34,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (1/1) ... [2025-01-09 06:06:34,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:06:34,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:06:34,830 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:34,840 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:34,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:06:34,872 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:06:34,872 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:06:34,872 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:06:34,872 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:06:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:06:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:06:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:06:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:06:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:06:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:06:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:06:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:06:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:06:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:06:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:06:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:06:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:06:34,873 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:06:34,873 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:06:34,874 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:06:34,874 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:06:34,874 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:06:34,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:06:34,875 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:06:34,876 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:06:34,876 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:06:34,876 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:06:34,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:06:34,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:06:34,876 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:06:34,876 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:06:34,985 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:06:34,990 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:06:35,414 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##48: assume !(1 == ~q_free~0); [2025-01-09 06:06:35,414 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:35,490 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2025-01-09 06:06:35,490 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:06:35,501 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:06:35,501 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2025-01-09 06:06:35,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:35 BoogieIcfgContainer [2025-01-09 06:06:35,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:06:35,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:06:35,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:06:35,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:06:35,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:06:34" (1/3) ... [2025-01-09 06:06:35,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f93805d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:35, skipping insertion in model container [2025-01-09 06:06:35,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:06:34" (2/3) ... [2025-01-09 06:06:35,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f93805d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:06:35, skipping insertion in model container [2025-01-09 06:06:35,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:06:35" (3/3) ... [2025-01-09 06:06:35,508 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.04.cil-1.c [2025-01-09 06:06:35,518 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:06:35,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_3.cil+token_ring.04.cil-1.c that has 15 procedures, 293 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-01-09 06:06:35,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:06:35,589 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;@1499d620, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:06:35,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:06:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 293 states, 244 states have (on average 1.540983606557377) internal successors, (376), 248 states have internal predecessors, (376), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 06:06:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:35,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:35,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:35,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:35,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:35,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1407593453, now seen corresponding path program 1 times [2025-01-09 06:06:35,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:35,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657190276] [2025-01-09 06:06:35,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:35,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:35,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:35,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:35,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:36,049 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:36,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:36,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657190276] [2025-01-09 06:06:36,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657190276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:36,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:36,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823742921] [2025-01-09 06:06:36,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:36,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:36,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:36,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:36,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:36,078 INFO L87 Difference]: Start difference. First operand has 293 states, 244 states have (on average 1.540983606557377) internal successors, (376), 248 states have internal predecessors, (376), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) 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:06:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:37,086 INFO L93 Difference]: Finished difference Result 724 states and 1098 transitions. [2025-01-09 06:06:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:37,088 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:06:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:37,101 INFO L225 Difference]: With dead ends: 724 [2025-01-09 06:06:37,105 INFO L226 Difference]: Without dead ends: 441 [2025-01-09 06:06:37,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 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:06:37,114 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 630 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:37,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1258 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:06:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-01-09 06:06:37,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 395. [2025-01-09 06:06:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 323 states have (on average 1.4953560371517027) internal successors, (483), 330 states have internal predecessors, (483), 47 states have call successors, (47), 21 states have call predecessors, (47), 23 states have return successors, (56), 46 states have call predecessors, (56), 45 states have call successors, (56) [2025-01-09 06:06:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 586 transitions. [2025-01-09 06:06:37,204 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 586 transitions. Word has length 63 [2025-01-09 06:06:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:37,205 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 586 transitions. [2025-01-09 06:06:37,206 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:06:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 586 transitions. [2025-01-09 06:06:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:06:37,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:37,210 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:37,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:06:37,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:37,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1392074735, now seen corresponding path program 1 times [2025-01-09 06:06:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:37,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871162387] [2025-01-09 06:06:37,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:37,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:06:37,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:06:37,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:37,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:37,314 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:37,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:37,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871162387] [2025-01-09 06:06:37,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871162387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:37,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:37,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:37,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443837432] [2025-01-09 06:06:37,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:37,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:37,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:37,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:37,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:37,319 INFO L87 Difference]: Start difference. First operand 395 states and 586 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:06:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:37,512 INFO L93 Difference]: Finished difference Result 984 states and 1439 transitions. [2025-01-09 06:06:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:37,513 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:06:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:37,517 INFO L225 Difference]: With dead ends: 984 [2025-01-09 06:06:37,517 INFO L226 Difference]: Without dead ends: 779 [2025-01-09 06:06:37,518 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:06:37,519 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 511 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:37,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1002 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-01-09 06:06:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 765. [2025-01-09 06:06:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 619 states have (on average 1.4523424878836833) internal successors, (899), 632 states have internal predecessors, (899), 87 states have call successors, (87), 49 states have call predecessors, (87), 57 states have return successors, (114), 86 states have call predecessors, (114), 85 states have call successors, (114) [2025-01-09 06:06:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1100 transitions. [2025-01-09 06:06:37,563 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1100 transitions. Word has length 63 [2025-01-09 06:06:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:37,563 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1100 transitions. [2025-01-09 06:06:37,564 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:06:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1100 transitions. [2025-01-09 06:06:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:37,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:37,566 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:06:37,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:06:37,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:37,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2133994192, now seen corresponding path program 1 times [2025-01-09 06:06:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:37,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141240519] [2025-01-09 06:06:37,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:37,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:37,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:37,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:37,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:37,650 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:37,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:37,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141240519] [2025-01-09 06:06:37,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141240519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:37,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:37,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:37,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219360399] [2025-01-09 06:06:37,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:37,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:37,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:37,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:37,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:37,657 INFO L87 Difference]: Start difference. First operand 765 states and 1100 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:37,758 INFO L93 Difference]: Finished difference Result 1360 states and 1951 transitions. [2025-01-09 06:06:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:37,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-01-09 06:06:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:37,772 INFO L225 Difference]: With dead ends: 1360 [2025-01-09 06:06:37,772 INFO L226 Difference]: Without dead ends: 785 [2025-01-09 06:06:37,774 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:06:37,774 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 0 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:37,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2074 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-01-09 06:06:37,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2025-01-09 06:06:37,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 635 states have (on average 1.4377952755905512) internal successors, (913), 648 states have internal predecessors, (913), 87 states have call successors, (87), 49 states have call predecessors, (87), 61 states have return successors, (120), 90 states have call predecessors, (120), 85 states have call successors, (120) [2025-01-09 06:06:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1120 transitions. [2025-01-09 06:06:37,840 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1120 transitions. Word has length 64 [2025-01-09 06:06:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:37,840 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1120 transitions. [2025-01-09 06:06:37,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:06:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1120 transitions. [2025-01-09 06:06:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 06:06:37,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:37,842 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:06:37,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:06:37,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:37,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1739627406, now seen corresponding path program 1 times [2025-01-09 06:06:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:37,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193052216] [2025-01-09 06:06:37,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:37,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 06:06:37,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 06:06:37,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:37,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:37,931 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:37,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:37,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193052216] [2025-01-09 06:06:37,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193052216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:37,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:37,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:37,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435629406] [2025-01-09 06:06:37,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:37,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:37,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:37,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:37,933 INFO L87 Difference]: Start difference. First operand 785 states and 1120 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:06:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:38,497 INFO L93 Difference]: Finished difference Result 2460 states and 3488 transitions. [2025-01-09 06:06:38,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:06:38,497 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:06:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:38,504 INFO L225 Difference]: With dead ends: 2460 [2025-01-09 06:06:38,504 INFO L226 Difference]: Without dead ends: 984 [2025-01-09 06:06:38,508 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:06:38,509 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 1297 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:38,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 1978 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:38,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-01-09 06:06:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 737. [2025-01-09 06:06:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 587 states have (on average 1.4071550255536627) internal successors, (826), 600 states have internal predecessors, (826), 87 states have call successors, (87), 49 states have call predecessors, (87), 61 states have return successors, (112), 90 states have call predecessors, (112), 85 states have call successors, (112) [2025-01-09 06:06:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1025 transitions. [2025-01-09 06:06:38,573 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1025 transitions. Word has length 64 [2025-01-09 06:06:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:38,573 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1025 transitions. [2025-01-09 06:06:38,574 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:06:38,574 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1025 transitions. [2025-01-09 06:06:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 06:06:38,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:38,575 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:06:38,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:06:38,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:38,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:38,577 INFO L85 PathProgramCache]: Analyzing trace with hash 873713025, now seen corresponding path program 1 times [2025-01-09 06:06:38,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:38,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834214530] [2025-01-09 06:06:38,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:38,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:38,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 06:06:38,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 06:06:38,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:38,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:38,711 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:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:38,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834214530] [2025-01-09 06:06:38,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834214530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:38,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:38,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:06:38,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843177680] [2025-01-09 06:06:38,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:38,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:06:38,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:38,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:06:38,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:06:38,713 INFO L87 Difference]: Start difference. First operand 737 states and 1025 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:39,359 INFO L93 Difference]: Finished difference Result 1580 states and 2188 transitions. [2025-01-09 06:06:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 06:06:39,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-01-09 06:06:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:39,362 INFO L225 Difference]: With dead ends: 1580 [2025-01-09 06:06:39,362 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 06:06:39,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:06:39,366 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 745 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:39,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 991 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:39,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 06:06:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-01-09 06:06:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 151 states have (on average 1.5231788079470199) internal successors, (230), 152 states have internal predecessors, (230), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 06:06:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 266 transitions. [2025-01-09 06:06:39,374 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 266 transitions. Word has length 65 [2025-01-09 06:06:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:39,375 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 266 transitions. [2025-01-09 06:06:39,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:06:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 266 transitions. [2025-01-09 06:06:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:39,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:39,376 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] [2025-01-09 06:06:39,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:06:39,376 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:39,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:39,376 INFO L85 PathProgramCache]: Analyzing trace with hash 74527362, now seen corresponding path program 1 times [2025-01-09 06:06:39,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:39,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971114825] [2025-01-09 06:06:39,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:39,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:39,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:39,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:39,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:39,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,409 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:39,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971114825] [2025-01-09 06:06:39,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971114825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:06:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209163374] [2025-01-09 06:06:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:06:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:06:39,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:06:39,411 INFO L87 Difference]: Start difference. First operand 176 states and 266 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:39,422 INFO L93 Difference]: Finished difference Result 345 states and 523 transitions. [2025-01-09 06:06:39,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:06:39,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-01-09 06:06:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:39,424 INFO L225 Difference]: With dead ends: 345 [2025-01-09 06:06:39,424 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 06:06:39,424 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:06:39,424 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 259 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:39,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 265 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 06:06:39,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-01-09 06:06:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 152 states have internal predecessors, (229), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 06:06:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 265 transitions. [2025-01-09 06:06:39,444 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 265 transitions. Word has length 88 [2025-01-09 06:06:39,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:39,444 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 265 transitions. [2025-01-09 06:06:39,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:39,444 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 265 transitions. [2025-01-09 06:06:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:39,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:39,445 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] [2025-01-09 06:06:39,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:06:39,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:39,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1217029828, now seen corresponding path program 1 times [2025-01-09 06:06:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:39,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016907840] [2025-01-09 06:06:39,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:39,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:39,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:39,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:39,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,528 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:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016907840] [2025-01-09 06:06:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016907840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:39,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999719131] [2025-01-09 06:06:39,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:39,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:39,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:39,531 INFO L87 Difference]: Start difference. First operand 176 states and 265 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:06:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:39,795 INFO L93 Difference]: Finished difference Result 518 states and 791 transitions. [2025-01-09 06:06:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:06:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 88 [2025-01-09 06:06:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:39,799 INFO L225 Difference]: With dead ends: 518 [2025-01-09 06:06:39,800 INFO L226 Difference]: Without dead ends: 355 [2025-01-09 06:06:39,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:39,801 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 469 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:39,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 706 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:06:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-01-09 06:06:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 342. [2025-01-09 06:06:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 297 states have (on average 1.531986531986532) internal successors, (455), 299 states have internal predecessors, (455), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-01-09 06:06:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 518 transitions. [2025-01-09 06:06:39,824 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 518 transitions. Word has length 88 [2025-01-09 06:06:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:39,824 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 518 transitions. [2025-01-09 06:06:39,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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:06:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 518 transitions. [2025-01-09 06:06:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:39,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:39,827 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] [2025-01-09 06:06:39,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:06:39,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:39,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:39,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1229215304, now seen corresponding path program 1 times [2025-01-09 06:06:39,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:39,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545174074] [2025-01-09 06:06:39,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:39,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:39,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:39,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:39,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:39,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:39,977 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:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545174074] [2025-01-09 06:06:39,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545174074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:39,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:39,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:39,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831132894] [2025-01-09 06:06:39,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:39,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:39,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:39,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:39,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:39,979 INFO L87 Difference]: Start difference. First operand 342 states and 518 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:40,323 INFO L93 Difference]: Finished difference Result 879 states and 1346 transitions. [2025-01-09 06:06:40,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:40,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-01-09 06:06:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:40,326 INFO L225 Difference]: With dead ends: 879 [2025-01-09 06:06:40,326 INFO L226 Difference]: Without dead ends: 550 [2025-01-09 06:06:40,327 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:06:40,327 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 463 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:40,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1322 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-01-09 06:06:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 497. [2025-01-09 06:06:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 432 states have (on average 1.525462962962963) internal successors, (659), 435 states have internal predecessors, (659), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-01-09 06:06:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 751 transitions. [2025-01-09 06:06:40,349 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 751 transitions. Word has length 88 [2025-01-09 06:06:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:40,349 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 751 transitions. [2025-01-09 06:06:40,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 751 transitions. [2025-01-09 06:06:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:40,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:40,350 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] [2025-01-09 06:06:40,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:06:40,350 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:40,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:40,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1306116102, now seen corresponding path program 1 times [2025-01-09 06:06:40,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:40,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600762399] [2025-01-09 06:06:40,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:40,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:40,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:40,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:40,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:40,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:40,444 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:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600762399] [2025-01-09 06:06:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600762399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424613597] [2025-01-09 06:06:40,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:40,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:40,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:40,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:40,446 INFO L87 Difference]: Start difference. First operand 497 states and 751 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:40,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:40,820 INFO L93 Difference]: Finished difference Result 1366 states and 2088 transitions. [2025-01-09 06:06:40,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:40,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-01-09 06:06:40,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:40,824 INFO L225 Difference]: With dead ends: 1366 [2025-01-09 06:06:40,824 INFO L226 Difference]: Without dead ends: 882 [2025-01-09 06:06:40,825 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:06:40,826 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 458 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:40,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1306 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-01-09 06:06:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 824. [2025-01-09 06:06:40,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 717 states have (on average 1.5258019525801954) internal successors, (1094), 724 states have internal predecessors, (1094), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-01-09 06:06:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1250 transitions. [2025-01-09 06:06:40,861 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1250 transitions. Word has length 88 [2025-01-09 06:06:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:40,861 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1250 transitions. [2025-01-09 06:06:40,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:40,862 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1250 transitions. [2025-01-09 06:06:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:40,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:40,862 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] [2025-01-09 06:06:40,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 06:06:40,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:40,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash 338765448, now seen corresponding path program 1 times [2025-01-09 06:06:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:40,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966554798] [2025-01-09 06:06:40,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:40,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:40,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:40,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:40,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:40,938 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:40,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:40,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966554798] [2025-01-09 06:06:40,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966554798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:40,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:40,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:40,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986748291] [2025-01-09 06:06:40,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:40,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:40,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:40,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:40,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:40,939 INFO L87 Difference]: Start difference. First operand 824 states and 1250 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:06:41,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:41,113 INFO L93 Difference]: Finished difference Result 1723 states and 2652 transitions. [2025-01-09 06:06:41,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-01-09 06:06:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:41,118 INFO L225 Difference]: With dead ends: 1723 [2025-01-09 06:06:41,118 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 06:06:41,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:41,120 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 337 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:41,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 492 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 06:06:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 824. [2025-01-09 06:06:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 717 states have (on average 1.5188284518828452) internal successors, (1089), 724 states have internal predecessors, (1089), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-01-09 06:06:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1245 transitions. [2025-01-09 06:06:41,160 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1245 transitions. Word has length 88 [2025-01-09 06:06:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:41,160 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1245 transitions. [2025-01-09 06:06:41,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:06:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1245 transitions. [2025-01-09 06:06:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:41,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:41,161 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] [2025-01-09 06:06:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:06:41,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:41,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2047744058, now seen corresponding path program 1 times [2025-01-09 06:06:41,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:41,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319353507] [2025-01-09 06:06:41,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:41,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:41,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:41,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:41,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:41,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:41,219 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:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319353507] [2025-01-09 06:06:41,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319353507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:41,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:41,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:41,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429860450] [2025-01-09 06:06:41,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:41,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:41,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:41,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:41,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:41,220 INFO L87 Difference]: Start difference. First operand 824 states and 1245 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:06:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:41,429 INFO L93 Difference]: Finished difference Result 1712 states and 2620 transitions. [2025-01-09 06:06:41,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:41,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-01-09 06:06:41,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:41,435 INFO L225 Difference]: With dead ends: 1712 [2025-01-09 06:06:41,435 INFO L226 Difference]: Without dead ends: 901 [2025-01-09 06:06:41,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:41,438 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 334 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:41,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 484 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2025-01-09 06:06:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 824. [2025-01-09 06:06:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 717 states have (on average 1.511854951185495) internal successors, (1084), 724 states have internal predecessors, (1084), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-01-09 06:06:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1240 transitions. [2025-01-09 06:06:41,499 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1240 transitions. Word has length 88 [2025-01-09 06:06:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:41,499 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1240 transitions. [2025-01-09 06:06:41,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:06:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1240 transitions. [2025-01-09 06:06:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:41,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:41,501 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:41,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:06:41,501 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:41,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:41,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1754597064, now seen corresponding path program 1 times [2025-01-09 06:06:41,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:41,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120463996] [2025-01-09 06:06:41,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:41,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:41,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:41,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:41,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:41,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:41,630 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:41,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:41,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120463996] [2025-01-09 06:06:41,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120463996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:41,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:41,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:41,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126490596] [2025-01-09 06:06:41,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:41,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:41,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:41,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:41,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:41,633 INFO L87 Difference]: Start difference. First operand 824 states and 1240 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:42,075 INFO L93 Difference]: Finished difference Result 2455 states and 3728 transitions. [2025-01-09 06:06:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:42,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-01-09 06:06:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:42,083 INFO L225 Difference]: With dead ends: 2455 [2025-01-09 06:06:42,083 INFO L226 Difference]: Without dead ends: 1644 [2025-01-09 06:06:42,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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:06:42,086 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 554 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:42,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 896 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:06:42,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2025-01-09 06:06:42,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1468. [2025-01-09 06:06:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 1275 states have (on average 1.5105882352941176) internal successors, (1926), 1296 states have internal predecessors, (1926), 118 states have call successors, (118), 54 states have call predecessors, (118), 74 states have return successors, (182), 125 states have call predecessors, (182), 118 states have call successors, (182) [2025-01-09 06:06:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 2226 transitions. [2025-01-09 06:06:42,236 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 2226 transitions. Word has length 88 [2025-01-09 06:06:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:42,237 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 2226 transitions. [2025-01-09 06:06:42,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 2226 transitions. [2025-01-09 06:06:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:42,239 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:42,239 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] [2025-01-09 06:06:42,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:06:42,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:42,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:42,240 INFO L85 PathProgramCache]: Analyzing trace with hash 538443338, now seen corresponding path program 1 times [2025-01-09 06:06:42,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:42,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766834507] [2025-01-09 06:06:42,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:42,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:42,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:42,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:42,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:42,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:42,348 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:42,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:42,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766834507] [2025-01-09 06:06:42,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766834507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:42,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:42,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:42,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583236919] [2025-01-09 06:06:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:42,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:42,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:42,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:42,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:42,350 INFO L87 Difference]: Start difference. First operand 1468 states and 2226 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:42,997 INFO L93 Difference]: Finished difference Result 4511 states and 6944 transitions. [2025-01-09 06:06:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:42,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-01-09 06:06:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:43,015 INFO L225 Difference]: With dead ends: 4511 [2025-01-09 06:06:43,015 INFO L226 Difference]: Without dead ends: 3056 [2025-01-09 06:06:43,019 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:06:43,020 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 452 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:43,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1217 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3056 states. [2025-01-09 06:06:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3056 to 2823. [2025-01-09 06:06:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2444 states have (on average 1.5130932896890343) internal successors, (3698), 2511 states have internal predecessors, (3698), 210 states have call successors, (210), 102 states have call predecessors, (210), 168 states have return successors, (466), 225 states have call predecessors, (466), 210 states have call successors, (466) [2025-01-09 06:06:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 4374 transitions. [2025-01-09 06:06:43,270 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 4374 transitions. Word has length 88 [2025-01-09 06:06:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:43,271 INFO L471 AbstractCegarLoop]: Abstraction has 2823 states and 4374 transitions. [2025-01-09 06:06:43,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 4374 transitions. [2025-01-09 06:06:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:43,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:43,275 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] [2025-01-09 06:06:43,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 06:06:43,275 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:43,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash -193524088, now seen corresponding path program 1 times [2025-01-09 06:06:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975782386] [2025-01-09 06:06:43,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:43,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:43,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:43,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:43,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:43,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:43,386 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:43,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:43,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975782386] [2025-01-09 06:06:43,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975782386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:43,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:43,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556161534] [2025-01-09 06:06:43,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:43,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:43,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:43,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:43,388 INFO L87 Difference]: Start difference. First operand 2823 states and 4374 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:44,327 INFO L93 Difference]: Finished difference Result 8764 states and 13958 transitions. [2025-01-09 06:06:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-01-09 06:06:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:44,367 INFO L225 Difference]: With dead ends: 8764 [2025-01-09 06:06:44,368 INFO L226 Difference]: Without dead ends: 5954 [2025-01-09 06:06:44,378 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:06:44,379 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 468 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:44,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1205 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:06:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5954 states. [2025-01-09 06:06:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5954 to 5644. [2025-01-09 06:06:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5644 states, 4847 states have (on average 1.5114503816793894) internal successors, (7326), 5060 states have internal predecessors, (7326), 386 states have call successors, (386), 198 states have call predecessors, (386), 410 states have return successors, (1410), 417 states have call predecessors, (1410), 386 states have call successors, (1410) [2025-01-09 06:06:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5644 states to 5644 states and 9122 transitions. [2025-01-09 06:06:44,886 INFO L78 Accepts]: Start accepts. Automaton has 5644 states and 9122 transitions. Word has length 88 [2025-01-09 06:06:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:44,886 INFO L471 AbstractCegarLoop]: Abstraction has 5644 states and 9122 transitions. [2025-01-09 06:06:44,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5644 states and 9122 transitions. [2025-01-09 06:06:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:44,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:44,891 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] [2025-01-09 06:06:44,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:06:44,892 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:44,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1879703926, now seen corresponding path program 1 times [2025-01-09 06:06:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:44,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695478276] [2025-01-09 06:06:44,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:44,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:44,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:44,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:44,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:44,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:44,987 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:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695478276] [2025-01-09 06:06:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695478276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:44,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914288032] [2025-01-09 06:06:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:44,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:44,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:44,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:44,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:44,989 INFO L87 Difference]: Start difference. First operand 5644 states and 9122 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:46,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:46,546 INFO L93 Difference]: Finished difference Result 17451 states and 29700 transitions. [2025-01-09 06:06:46,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:46,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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 88 [2025-01-09 06:06:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:46,641 INFO L225 Difference]: With dead ends: 17451 [2025-01-09 06:06:46,641 INFO L226 Difference]: Without dead ends: 11820 [2025-01-09 06:06:46,667 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:06:46,668 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 433 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:46,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1193 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:06:46,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11820 states. [2025-01-09 06:06:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11820 to 11481. [2025-01-09 06:06:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11481 states, 9702 states have (on average 1.4980416408987838) internal successors, (14534), 10369 states have internal predecessors, (14534), 722 states have call successors, (722), 390 states have call predecessors, (722), 1056 states have return successors, (4818), 785 states have call predecessors, (4818), 722 states have call successors, (4818) [2025-01-09 06:06:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11481 states to 11481 states and 20074 transitions. [2025-01-09 06:06:47,705 INFO L78 Accepts]: Start accepts. Automaton has 11481 states and 20074 transitions. Word has length 88 [2025-01-09 06:06:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:47,705 INFO L471 AbstractCegarLoop]: Abstraction has 11481 states and 20074 transitions. [2025-01-09 06:06:47,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 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:06:47,706 INFO L276 IsEmpty]: Start isEmpty. Operand 11481 states and 20074 transitions. [2025-01-09 06:06:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:47,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:47,712 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] [2025-01-09 06:06:47,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:06:47,713 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:47,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1934096824, now seen corresponding path program 1 times [2025-01-09 06:06:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534486870] [2025-01-09 06:06:47,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:47,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:47,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:47,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:47,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:47,827 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:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534486870] [2025-01-09 06:06:47,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534486870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:47,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:47,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119934563] [2025-01-09 06:06:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:47,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:47,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:47,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:47,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:47,831 INFO L87 Difference]: Start difference. First operand 11481 states and 20074 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:48,597 INFO L93 Difference]: Finished difference Result 23143 states and 40716 transitions. [2025-01-09 06:06:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:48,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-01-09 06:06:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:48,663 INFO L225 Difference]: With dead ends: 23143 [2025-01-09 06:06:48,663 INFO L226 Difference]: Without dead ends: 11676 [2025-01-09 06:06:48,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:48,712 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:48,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1034 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11676 states. [2025-01-09 06:06:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11676 to 11676. [2025-01-09 06:06:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11676 states, 9897 states have (on average 1.4882287561887442) internal successors, (14729), 10564 states have internal predecessors, (14729), 722 states have call successors, (722), 390 states have call predecessors, (722), 1056 states have return successors, (4818), 785 states have call predecessors, (4818), 722 states have call successors, (4818) [2025-01-09 06:06:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11676 states to 11676 states and 20269 transitions. [2025-01-09 06:06:49,990 INFO L78 Accepts]: Start accepts. Automaton has 11676 states and 20269 transitions. Word has length 88 [2025-01-09 06:06:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:49,992 INFO L471 AbstractCegarLoop]: Abstraction has 11676 states and 20269 transitions. [2025-01-09 06:06:49,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 11676 states and 20269 transitions. [2025-01-09 06:06:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:50,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:50,002 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] [2025-01-09 06:06:50,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:06:50,002 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:50,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash -547311414, now seen corresponding path program 1 times [2025-01-09 06:06:50,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:50,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113365339] [2025-01-09 06:06:50,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:50,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:50,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:50,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:50,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:50,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:06:50,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:50,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113365339] [2025-01-09 06:06:50,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113365339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:50,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:50,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:06:50,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440494858] [2025-01-09 06:06:50,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:50,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:06:50,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:50,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:06:50,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:06:50,066 INFO L87 Difference]: Start difference. First operand 11676 states and 20269 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:51,340 INFO L93 Difference]: Finished difference Result 34770 states and 60669 transitions. [2025-01-09 06:06:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:06:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-01-09 06:06:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:51,418 INFO L225 Difference]: With dead ends: 34770 [2025-01-09 06:06:51,419 INFO L226 Difference]: Without dead ends: 23108 [2025-01-09 06:06:51,442 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:06:51,443 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 454 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:51,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 903 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:06:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23108 states. [2025-01-09 06:06:53,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23108 to 23041. [2025-01-09 06:06:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23041 states, 19521 states have (on average 1.4815327083653502) internal successors, (28921), 20854 states have internal predecessors, (28921), 1407 states have call successors, (1407), 780 states have call predecessors, (1407), 2112 states have return successors, (9536), 1470 states have call predecessors, (9536), 1407 states have call successors, (9536) [2025-01-09 06:06:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23041 states to 23041 states and 39864 transitions. [2025-01-09 06:06:53,300 INFO L78 Accepts]: Start accepts. Automaton has 23041 states and 39864 transitions. Word has length 88 [2025-01-09 06:06:53,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:53,301 INFO L471 AbstractCegarLoop]: Abstraction has 23041 states and 39864 transitions. [2025-01-09 06:06:53,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 23041 states and 39864 transitions. [2025-01-09 06:06:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:53,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:53,311 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] [2025-01-09 06:06:53,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 06:06:53,312 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:53,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash -821089909, now seen corresponding path program 1 times [2025-01-09 06:06:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:53,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481088897] [2025-01-09 06:06:53,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:53,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:53,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:53,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:53,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:53,375 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:53,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:53,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481088897] [2025-01-09 06:06:53,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481088897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:53,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:53,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:53,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318579810] [2025-01-09 06:06:53,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:53,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:53,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:53,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:53,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:53,377 INFO L87 Difference]: Start difference. First operand 23041 states and 39864 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:54,449 INFO L93 Difference]: Finished difference Result 46263 states and 80591 transitions. [2025-01-09 06:06:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:54,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-01-09 06:06:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:54,537 INFO L225 Difference]: With dead ends: 46263 [2025-01-09 06:06:54,537 INFO L226 Difference]: Without dead ends: 23236 [2025-01-09 06:06:54,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:54,587 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:54,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1034 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23236 states. [2025-01-09 06:06:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23236 to 23236. [2025-01-09 06:06:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23236 states, 19716 states have (on average 1.4734733211604787) internal successors, (29051), 21049 states have internal predecessors, (29051), 1407 states have call successors, (1407), 780 states have call predecessors, (1407), 2112 states have return successors, (9536), 1470 states have call predecessors, (9536), 1407 states have call successors, (9536) [2025-01-09 06:06:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23236 states to 23236 states and 39994 transitions. [2025-01-09 06:06:56,297 INFO L78 Accepts]: Start accepts. Automaton has 23236 states and 39994 transitions. Word has length 88 [2025-01-09 06:06:56,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:56,297 INFO L471 AbstractCegarLoop]: Abstraction has 23236 states and 39994 transitions. [2025-01-09 06:06:56,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 23236 states and 39994 transitions. [2025-01-09 06:06:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:06:56,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:56,307 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] [2025-01-09 06:06:56,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 06:06:56,307 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:56,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash -836608627, now seen corresponding path program 1 times [2025-01-09 06:06:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:56,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380112523] [2025-01-09 06:06:56,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:56,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:06:56,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:06:56,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:56,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:56,379 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:56,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:56,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380112523] [2025-01-09 06:06:56,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380112523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:56,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:56,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:06:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213376243] [2025-01-09 06:06:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:56,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:06:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:56,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:06:56,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:56,381 INFO L87 Difference]: Start difference. First operand 23236 states and 39994 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:06:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:58,249 INFO L93 Difference]: Finished difference Result 46848 states and 81111 transitions. [2025-01-09 06:06:58,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:06:58,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-01-09 06:06:58,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:58,378 INFO L225 Difference]: With dead ends: 46848 [2025-01-09 06:06:58,379 INFO L226 Difference]: Without dead ends: 23626 [2025-01-09 06:06:58,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:06:58,446 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:58,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1034 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:06:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23626 states. [2025-01-09 06:07:00,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23626 to 23626. [2025-01-09 06:07:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23626 states, 20106 states have (on average 1.4642892668855068) internal successors, (29441), 21439 states have internal predecessors, (29441), 1407 states have call successors, (1407), 780 states have call predecessors, (1407), 2112 states have return successors, (9536), 1470 states have call predecessors, (9536), 1407 states have call successors, (9536) [2025-01-09 06:07:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23626 states to 23626 states and 40384 transitions. [2025-01-09 06:07:00,286 INFO L78 Accepts]: Start accepts. Automaton has 23626 states and 40384 transitions. Word has length 88 [2025-01-09 06:07:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:00,286 INFO L471 AbstractCegarLoop]: Abstraction has 23626 states and 40384 transitions. [2025-01-09 06:07:00,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 23626 states and 40384 transitions. [2025-01-09 06:07:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:07:00,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:00,294 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] [2025-01-09 06:07:00,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:07:00,294 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:00,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:00,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1734001905, now seen corresponding path program 1 times [2025-01-09 06:07:00,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:00,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410474982] [2025-01-09 06:07:00,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:00,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:07:00,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:07:00,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:00,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:07:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:00,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410474982] [2025-01-09 06:07:00,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410474982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:00,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:00,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:07:00,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719666841] [2025-01-09 06:07:00,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:00,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:07:00,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:00,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:07:00,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:00,360 INFO L87 Difference]: Start difference. First operand 23626 states and 40384 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:03,030 INFO L93 Difference]: Finished difference Result 70391 states and 120949 transitions. [2025-01-09 06:07:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:07:03,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-01-09 06:07:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:03,252 INFO L225 Difference]: With dead ends: 70391 [2025-01-09 06:07:03,253 INFO L226 Difference]: Without dead ends: 46779 [2025-01-09 06:07:03,320 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:03,321 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 466 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:03,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 903 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 06:07:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46779 states. [2025-01-09 06:07:07,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46779 to 46647. [2025-01-09 06:07:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46647 states, 39678 states have (on average 1.4573315187257423) internal successors, (57824), 42343 states have internal predecessors, (57824), 2744 states have call successors, (2744), 1560 states have call predecessors, (2744), 4224 states have return successors, (18939), 2807 states have call predecessors, (18939), 2744 states have call successors, (18939) [2025-01-09 06:07:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46647 states to 46647 states and 79507 transitions. [2025-01-09 06:07:07,589 INFO L78 Accepts]: Start accepts. Automaton has 46647 states and 79507 transitions. Word has length 88 [2025-01-09 06:07:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:07,590 INFO L471 AbstractCegarLoop]: Abstraction has 46647 states and 79507 transitions. [2025-01-09 06:07:07,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 46647 states and 79507 transitions. [2025-01-09 06:07:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:07:07,608 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:07,608 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] [2025-01-09 06:07:07,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:07:07,612 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:07,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2075790672, now seen corresponding path program 1 times [2025-01-09 06:07:07,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:07,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326456220] [2025-01-09 06:07:07,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:07,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:07:07,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:07:07,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:07,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:07,673 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,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:07,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326456220] [2025-01-09 06:07:07,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326456220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:07,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:07,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:07:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120460634] [2025-01-09 06:07:07,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:07,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:07:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:07,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:07:07,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:07,676 INFO L87 Difference]: Start difference. First operand 46647 states and 79507 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:07:10,026 INFO L93 Difference]: Finished difference Result 93670 states and 160694 transitions. [2025-01-09 06:07:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:07:10,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 88 [2025-01-09 06:07:10,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:07:10,252 INFO L225 Difference]: With dead ends: 93670 [2025-01-09 06:07:10,252 INFO L226 Difference]: Without dead ends: 47037 [2025-01-09 06:07:10,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:07:10,355 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:07:10,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1034 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:07:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47037 states. [2025-01-09 06:07:13,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47037 to 47037. [2025-01-09 06:07:13,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47037 states, 40068 states have (on average 1.4496356194469402) internal successors, (58084), 42733 states have internal predecessors, (58084), 2744 states have call successors, (2744), 1560 states have call predecessors, (2744), 4224 states have return successors, (18939), 2807 states have call predecessors, (18939), 2744 states have call successors, (18939) [2025-01-09 06:07:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47037 states to 47037 states and 79767 transitions. [2025-01-09 06:07:13,700 INFO L78 Accepts]: Start accepts. Automaton has 47037 states and 79767 transitions. Word has length 88 [2025-01-09 06:07:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:07:13,701 INFO L471 AbstractCegarLoop]: Abstraction has 47037 states and 79767 transitions. [2025-01-09 06:07:13,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 06:07:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 47037 states and 79767 transitions. [2025-01-09 06:07:13,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 06:07:13,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:07:13,707 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] [2025-01-09 06:07:13,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:07:13,707 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:07:13,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:07:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1559645102, now seen corresponding path program 1 times [2025-01-09 06:07:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:07:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621368222] [2025-01-09 06:07:13,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:07:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:07:13,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 06:07:13,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 06:07:13,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:07:13,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:07:13,737 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,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:07:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621368222] [2025-01-09 06:07:13,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621368222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:07:13,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:07:13,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:07:13,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145415071] [2025-01-09 06:07:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:07:13,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:07:13,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:07:13,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:07:13,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:07:13,738 INFO L87 Difference]: Start difference. First operand 47037 states and 79767 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)