./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a46e7920fd800fb5978581c250ecd4216776e6eac1b8dfb89d2f8a9c2732a33c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 06:05:08,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 06:05:08,100 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:05:08,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 06:05:08,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 06:05:08,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 06:05:08,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 06:05:08,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 06:05:08,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 06:05:08,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 06:05:08,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 06:05:08,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 06:05:08,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 06:05:08,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 06:05:08,126 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 06:05:08,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 06:05:08,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 06:05:08,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 06:05:08,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 06:05:08,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 06:05:08,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 06:05:08,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 06:05:08,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 06:05:08,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 06:05:08,127 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 06:05:08,127 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 06:05:08,127 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 06:05:08,127 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 06:05:08,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 06:05:08,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:05:08,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:05:08,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:05:08,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:05:08,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 06:05:08,128 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 06:05:08,128 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 06:05:08,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 06:05:08,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:05:08,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 06:05:08,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 06:05:08,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 06:05:08,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 06:05:08,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 06:05:08,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 06:05:08,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 06:05:08,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 06:05:08,129 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 06:05:08,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 06:05:08,129 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 -> a46e7920fd800fb5978581c250ecd4216776e6eac1b8dfb89d2f8a9c2732a33c [2025-01-09 06:05:08,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 06:05:08,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 06:05:08,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 06:05:08,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 06:05:08,403 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 06:05:08,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2025-01-09 06:05:09,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87c560bd0/38699f715c9545278190ef25c52b9c24/FLAG46c7131b6 [2025-01-09 06:05:10,080 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 06:05:10,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2025-01-09 06:05:10,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87c560bd0/38699f715c9545278190ef25c52b9c24/FLAG46c7131b6 [2025-01-09 06:05:10,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/87c560bd0/38699f715c9545278190ef25c52b9c24 [2025-01-09 06:05:10,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 06:05:10,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 06:05:10,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 06:05:10,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 06:05:10,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 06:05:10,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522b042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10, skipping insertion in model container [2025-01-09 06:05:10,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 06:05:10,311 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[914,927] [2025-01-09 06:05:10,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2025-01-09 06:05:10,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:05:10,481 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 06:05:10,491 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[914,927] [2025-01-09 06:05:10,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.12.cil-2.c[7115,7128] [2025-01-09 06:05:10,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 06:05:10,585 INFO L204 MainTranslator]: Completed translation [2025-01-09 06:05:10,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10 WrapperNode [2025-01-09 06:05:10,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 06:05:10,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 06:05:10,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 06:05:10,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 06:05:10,594 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:05:10" (1/1) ... [2025-01-09 06:05:10,605 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:05:10" (1/1) ... [2025-01-09 06:05:10,654 INFO L138 Inliner]: procedures = 77, calls = 93, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1011 [2025-01-09 06:05:10,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 06:05:10,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 06:05:10,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 06:05:10,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 06:05:10,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,691 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:05:10,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,711 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 06:05:10,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 06:05:10,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 06:05:10,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 06:05:10,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (1/1) ... [2025-01-09 06:05:10,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 06:05:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:10,790 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:05:10,804 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:05:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 06:05:10,829 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 06:05:10,830 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 06:05:10,830 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-01-09 06:05:10,830 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-01-09 06:05:10,830 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-01-09 06:05:10,830 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-01-09 06:05:10,830 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-01-09 06:05:10,830 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-01-09 06:05:10,830 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-01-09 06:05:10,833 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-01-09 06:05:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-01-09 06:05:10,833 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-01-09 06:05:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-01-09 06:05:10,833 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-01-09 06:05:10,833 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-01-09 06:05:10,833 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-01-09 06:05:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-01-09 06:05:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-01-09 06:05:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-01-09 06:05:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-01-09 06:05:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-01-09 06:05:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-01-09 06:05:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 06:05:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-01-09 06:05:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-01-09 06:05:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-01-09 06:05:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-01-09 06:05:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 06:05:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 06:05:10,834 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-01-09 06:05:10,834 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-01-09 06:05:10,951 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 06:05:10,954 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 06:05:12,050 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-01-09 06:05:12,050 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 06:05:12,070 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 06:05:12,071 INFO L312 CfgBuilder]: Removed 19 assume(true) statements. [2025-01-09 06:05:12,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:05:12 BoogieIcfgContainer [2025-01-09 06:05:12,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 06:05:12,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 06:05:12,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 06:05:12,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 06:05:12,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:05:10" (1/3) ... [2025-01-09 06:05:12,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ca8fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:05:12, skipping insertion in model container [2025-01-09 06:05:12,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:05:10" (2/3) ... [2025-01-09 06:05:12,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ca8fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:05:12, skipping insertion in model container [2025-01-09 06:05:12,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:05:12" (3/3) ... [2025-01-09 06:05:12,080 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.12.cil-2.c [2025-01-09 06:05:12,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 06:05:12,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.12.cil-2.c that has 15 procedures, 477 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-01-09 06:05:12,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 06:05:12,168 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;@432c0dde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 06:05:12,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 06:05:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 477 states, 422 states have (on average 1.5971563981042654) internal successors, (674), 426 states have internal predecessors, (674), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 06:05:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:12,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:12,184 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:12,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:12,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -106787040, now seen corresponding path program 1 times [2025-01-09 06:05:12,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061736441] [2025-01-09 06:05:12,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:12,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:12,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:12,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:12,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:12,634 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:05:12,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:12,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061736441] [2025-01-09 06:05:12,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061736441] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:12,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:12,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:12,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880309984] [2025-01-09 06:05:12,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:12,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:12,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:12,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:12,669 INFO L87 Difference]: Start difference. First operand has 477 states, 422 states have (on average 1.5971563981042654) internal successors, (674), 426 states have internal predecessors, (674), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:13,664 INFO L93 Difference]: Finished difference Result 1025 states and 1612 transitions. [2025-01-09 06:05:13,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:13,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:05:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:13,680 INFO L225 Difference]: With dead ends: 1025 [2025-01-09 06:05:13,680 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 06:05:13,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:13,693 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 476 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:13,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 1512 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:05:13,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 06:05:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 559. [2025-01-09 06:05:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 484 states have (on average 1.537190082644628) internal successors, (744), 490 states have internal predecessors, (744), 51 states have call successors, (51), 21 states have call predecessors, (51), 22 states have return successors, (54), 50 states have call predecessors, (54), 49 states have call successors, (54) [2025-01-09 06:05:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 849 transitions. [2025-01-09 06:05:13,787 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 849 transitions. Word has length 62 [2025-01-09 06:05:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:13,788 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 849 transitions. [2025-01-09 06:05:13,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 849 transitions. [2025-01-09 06:05:13,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:13,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:13,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:13,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 06:05:13,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:13,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash -388625759, now seen corresponding path program 1 times [2025-01-09 06:05:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:13,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131347656] [2025-01-09 06:05:13,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:13,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:13,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:13,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:13,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:14,033 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:05:14,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:14,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131347656] [2025-01-09 06:05:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131347656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:14,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:14,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354439737] [2025-01-09 06:05:14,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:14,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:14,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:14,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:14,038 INFO L87 Difference]: Start difference. First operand 559 states and 849 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:14,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:14,921 INFO L93 Difference]: Finished difference Result 864 states and 1268 transitions. [2025-01-09 06:05:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:14,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:05:14,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:14,931 INFO L225 Difference]: With dead ends: 864 [2025-01-09 06:05:14,931 INFO L226 Difference]: Without dead ends: 695 [2025-01-09 06:05:14,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 06:05:14,936 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 1079 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:14,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1527 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:05:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-01-09 06:05:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 651. [2025-01-09 06:05:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 556 states have (on average 1.5179856115107915) internal successors, (844), 564 states have internal predecessors, (844), 62 states have call successors, (62), 28 states have call predecessors, (62), 31 states have return successors, (73), 62 states have call predecessors, (73), 60 states have call successors, (73) [2025-01-09 06:05:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 979 transitions. [2025-01-09 06:05:14,993 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 979 transitions. Word has length 62 [2025-01-09 06:05:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:14,993 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 979 transitions. [2025-01-09 06:05:14,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 979 transitions. [2025-01-09 06:05:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:14,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:14,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:14,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 06:05:14,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:14,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:14,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1550536287, now seen corresponding path program 1 times [2025-01-09 06:05:14,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:14,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207776984] [2025-01-09 06:05:14,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:14,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:15,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:15,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:15,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:15,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:15,106 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:05:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:15,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207776984] [2025-01-09 06:05:15,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207776984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:15,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:15,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121510005] [2025-01-09 06:05:15,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:15,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:15,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:15,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:15,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:15,109 INFO L87 Difference]: Start difference. First operand 651 states and 979 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:15,161 INFO L93 Difference]: Finished difference Result 911 states and 1340 transitions. [2025-01-09 06:05:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:15,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-01-09 06:05:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:15,168 INFO L225 Difference]: With dead ends: 911 [2025-01-09 06:05:15,168 INFO L226 Difference]: Without dead ends: 656 [2025-01-09 06:05:15,170 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:05:15,170 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 0 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:15,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3585 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-01-09 06:05:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2025-01-09 06:05:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 560 states have (on average 1.5107142857142857) internal successors, (846), 568 states have internal predecessors, (846), 62 states have call successors, (62), 28 states have call predecessors, (62), 32 states have return successors, (74), 63 states have call predecessors, (74), 60 states have call successors, (74) [2025-01-09 06:05:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 982 transitions. [2025-01-09 06:05:15,219 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 982 transitions. Word has length 62 [2025-01-09 06:05:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:15,220 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 982 transitions. [2025-01-09 06:05:15,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 982 transitions. [2025-01-09 06:05:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:15,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:15,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:15,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 06:05:15,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:15,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 706530785, now seen corresponding path program 1 times [2025-01-09 06:05:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:15,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129728583] [2025-01-09 06:05:15,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:15,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:15,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:15,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:15,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:15,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129728583] [2025-01-09 06:05:15,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129728583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:15,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:15,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383767209] [2025-01-09 06:05:15,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:15,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:15,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:15,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:15,332 INFO L87 Difference]: Start difference. First operand 656 states and 982 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:05:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:15,967 INFO L93 Difference]: Finished difference Result 2582 states and 3666 transitions. [2025-01-09 06:05:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:15,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2025-01-09 06:05:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:15,981 INFO L225 Difference]: With dead ends: 2582 [2025-01-09 06:05:15,982 INFO L226 Difference]: Without dead ends: 2322 [2025-01-09 06:05:15,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 06:05:15,985 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 1950 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1956 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:15,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1956 Valid, 2700 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:05:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2025-01-09 06:05:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2192. [2025-01-09 06:05:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 1757 states have (on average 1.3870233352305066) internal successors, (2437), 1793 states have internal predecessors, (2437), 227 states have call successors, (227), 172 states have call predecessors, (227), 206 states have return successors, (343), 230 states have call predecessors, (343), 225 states have call successors, (343) [2025-01-09 06:05:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 3007 transitions. [2025-01-09 06:05:16,127 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 3007 transitions. Word has length 62 [2025-01-09 06:05:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:16,128 INFO L471 AbstractCegarLoop]: Abstraction has 2192 states and 3007 transitions. [2025-01-09 06:05:16,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-01-09 06:05:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 3007 transitions. [2025-01-09 06:05:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:16,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:16,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:16,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 06:05:16,130 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:16,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1625505408, now seen corresponding path program 1 times [2025-01-09 06:05:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:16,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217998147] [2025-01-09 06:05:16,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:16,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:16,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:16,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:16,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:16,224 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:05:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:16,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217998147] [2025-01-09 06:05:16,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217998147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:16,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:16,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172355850] [2025-01-09 06:05:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:16,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:16,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:16,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:16,227 INFO L87 Difference]: Start difference. First operand 2192 states and 3007 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:16,386 INFO L93 Difference]: Finished difference Result 4033 states and 5498 transitions. [2025-01-09 06:05:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:16,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-01-09 06:05:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:16,398 INFO L225 Difference]: With dead ends: 4033 [2025-01-09 06:05:16,400 INFO L226 Difference]: Without dead ends: 2237 [2025-01-09 06:05:16,406 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:05:16,407 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 0 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:16,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3585 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2025-01-09 06:05:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2237. [2025-01-09 06:05:16,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 1793 states have (on average 1.3708867819297268) internal successors, (2458), 1829 states have internal predecessors, (2458), 227 states have call successors, (227), 172 states have call predecessors, (227), 215 states have return successors, (361), 239 states have call predecessors, (361), 225 states have call successors, (361) [2025-01-09 06:05:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3046 transitions. [2025-01-09 06:05:16,521 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3046 transitions. Word has length 62 [2025-01-09 06:05:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:16,521 INFO L471 AbstractCegarLoop]: Abstraction has 2237 states and 3046 transitions. [2025-01-09 06:05:16,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3046 transitions. [2025-01-09 06:05:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 06:05:16,523 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:16,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:16,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 06:05:16,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:16,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1687545022, now seen corresponding path program 1 times [2025-01-09 06:05:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:16,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934083467] [2025-01-09 06:05:16,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:16,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 06:05:16,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 06:05:16,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:16,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:16,593 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:05:16,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:16,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934083467] [2025-01-09 06:05:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934083467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:16,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:05:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012340795] [2025-01-09 06:05:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:16,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:05:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:16,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:05:16,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:05:16,595 INFO L87 Difference]: Start difference. First operand 2237 states and 3046 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:17,228 INFO L93 Difference]: Finished difference Result 5846 states and 7838 transitions. [2025-01-09 06:05:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 06:05:17,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2025-01-09 06:05:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:17,255 INFO L225 Difference]: With dead ends: 5846 [2025-01-09 06:05:17,256 INFO L226 Difference]: Without dead ends: 4008 [2025-01-09 06:05:17,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:17,264 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1017 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:17,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 754 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:05:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2025-01-09 06:05:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 4004. [2025-01-09 06:05:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4004 states, 3145 states have (on average 1.3192368839427664) internal successors, (4149), 3216 states have internal predecessors, (4149), 428 states have call successors, (428), 337 states have call predecessors, (428), 429 states have return successors, (755), 457 states have call predecessors, (755), 426 states have call successors, (755) [2025-01-09 06:05:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4004 states to 4004 states and 5332 transitions. [2025-01-09 06:05:17,570 INFO L78 Accepts]: Start accepts. Automaton has 4004 states and 5332 transitions. Word has length 62 [2025-01-09 06:05:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:17,571 INFO L471 AbstractCegarLoop]: Abstraction has 4004 states and 5332 transitions. [2025-01-09 06:05:17,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 06:05:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4004 states and 5332 transitions. [2025-01-09 06:05:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 06:05:17,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:17,573 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:05:17,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 06:05:17,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:17,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash -990019010, now seen corresponding path program 1 times [2025-01-09 06:05:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:17,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547918831] [2025-01-09 06:05:17,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:17,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:17,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 06:05:17,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 06:05:17,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:17,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:17,641 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:05:17,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:17,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547918831] [2025-01-09 06:05:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547918831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:17,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868234424] [2025-01-09 06:05:17,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:17,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:17,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:17,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:17,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:17,644 INFO L87 Difference]: Start difference. First operand 4004 states and 5332 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:17,961 INFO L93 Difference]: Finished difference Result 9929 states and 13190 transitions. [2025-01-09 06:05:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:17,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-01-09 06:05:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:18,009 INFO L225 Difference]: With dead ends: 9929 [2025-01-09 06:05:18,009 INFO L226 Difference]: Without dead ends: 6303 [2025-01-09 06:05:18,024 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:05:18,026 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 102 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:18,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1418 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6303 states. [2025-01-09 06:05:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6303 to 6149. [2025-01-09 06:05:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 4762 states have (on average 1.3013439731205376) internal successors, (6197), 4848 states have internal predecessors, (6197), 687 states have call successors, (687), 567 states have call predecessors, (687), 698 states have return successors, (1207), 740 states have call predecessors, (1207), 685 states have call successors, (1207) [2025-01-09 06:05:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8091 transitions. [2025-01-09 06:05:18,409 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8091 transitions. Word has length 63 [2025-01-09 06:05:18,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:18,410 INFO L471 AbstractCegarLoop]: Abstraction has 6149 states and 8091 transitions. [2025-01-09 06:05:18,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 06:05:18,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8091 transitions. [2025-01-09 06:05:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 06:05:18,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:18,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:18,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 06:05:18,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:18,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1529246326, now seen corresponding path program 1 times [2025-01-09 06:05:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064936669] [2025-01-09 06:05:18,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:18,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 06:05:18,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 06:05:18,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:18,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:18,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064936669] [2025-01-09 06:05:18,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064936669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:18,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:18,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 06:05:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075143329] [2025-01-09 06:05:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:18,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 06:05:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:18,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 06:05:18,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 06:05:18,503 INFO L87 Difference]: Start difference. First operand 6149 states and 8091 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:05:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:19,103 INFO L93 Difference]: Finished difference Result 7285 states and 9500 transitions. [2025-01-09 06:05:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:19,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2025-01-09 06:05:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:19,152 INFO L225 Difference]: With dead ends: 7285 [2025-01-09 06:05:19,152 INFO L226 Difference]: Without dead ends: 7282 [2025-01-09 06:05:19,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:19,158 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 1349 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:19,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 817 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:05:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2025-01-09 06:05:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7183. [2025-01-09 06:05:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7183 states, 5539 states have (on average 1.2906661852319914) internal successors, (7149), 5638 states have internal predecessors, (7149), 813 states have call successors, (813), 681 states have call predecessors, (813), 829 states have return successors, (1410), 870 states have call predecessors, (1410), 812 states have call successors, (1410) [2025-01-09 06:05:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 9372 transitions. [2025-01-09 06:05:19,733 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 9372 transitions. Word has length 68 [2025-01-09 06:05:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:19,733 INFO L471 AbstractCegarLoop]: Abstraction has 7183 states and 9372 transitions. [2025-01-09 06:05:19,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:05:19,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 9372 transitions. [2025-01-09 06:05:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 06:05:19,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:19,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:19,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 06:05:19,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:19,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -163355743, now seen corresponding path program 1 times [2025-01-09 06:05:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:19,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089315932] [2025-01-09 06:05:19,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:19,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:05:19,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:05:19,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:19,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:19,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089315932] [2025-01-09 06:05:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089315932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:05:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372253238] [2025-01-09 06:05:19,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:19,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:19,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:19,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:05:19,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 06:05:20,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 06:05:20,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 06:05:20,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:20,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:20,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 06:05:20,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:05:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:20,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:05:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:20,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372253238] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:05:20,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:05:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2025-01-09 06:05:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735931018] [2025-01-09 06:05:20,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:05:20,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:05:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:20,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:05:20,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:05:20,381 INFO L87 Difference]: Start difference. First operand 7183 states and 9372 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:05:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:21,273 INFO L93 Difference]: Finished difference Result 15023 states and 19371 transitions. [2025-01-09 06:05:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:05:21,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 69 [2025-01-09 06:05:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:21,365 INFO L225 Difference]: With dead ends: 15023 [2025-01-09 06:05:21,365 INFO L226 Difference]: Without dead ends: 15020 [2025-01-09 06:05:21,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:05:21,379 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 1092 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:21,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 2678 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 06:05:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15020 states. [2025-01-09 06:05:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15020 to 13688. [2025-01-09 06:05:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13688 states, 10522 states have (on average 1.280364949629348) internal successors, (13472), 10711 states have internal predecessors, (13472), 1541 states have call successors, (1541), 1311 states have call predecessors, (1541), 1623 states have return successors, (2711), 1672 states have call predecessors, (2711), 1540 states have call successors, (2711) [2025-01-09 06:05:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13688 states to 13688 states and 17724 transitions. [2025-01-09 06:05:22,374 INFO L78 Accepts]: Start accepts. Automaton has 13688 states and 17724 transitions. Word has length 69 [2025-01-09 06:05:22,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:22,375 INFO L471 AbstractCegarLoop]: Abstraction has 13688 states and 17724 transitions. [2025-01-09 06:05:22,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 06:05:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 13688 states and 17724 transitions. [2025-01-09 06:05:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 06:05:22,379 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:22,379 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:22,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 06:05:22,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:22,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:22,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1803548767, now seen corresponding path program 2 times [2025-01-09 06:05:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:22,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216482768] [2025-01-09 06:05:22,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 06:05:22,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:22,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-09 06:05:22,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 06:05:22,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 06:05:22,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:22,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216482768] [2025-01-09 06:05:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216482768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:22,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:22,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533914888] [2025-01-09 06:05:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:22,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:22,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:22,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:22,638 INFO L87 Difference]: Start difference. First operand 13688 states and 17724 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:05:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:23,153 INFO L93 Difference]: Finished difference Result 20462 states and 26541 transitions. [2025-01-09 06:05:23,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:23,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2025-01-09 06:05:23,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:23,191 INFO L225 Difference]: With dead ends: 20462 [2025-01-09 06:05:23,191 INFO L226 Difference]: Without dead ends: 8006 [2025-01-09 06:05:23,218 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:05:23,219 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 690 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:23,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 907 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:23,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8006 states. [2025-01-09 06:05:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8006 to 7908. [2025-01-09 06:05:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7908 states, 6111 states have (on average 1.261168384879725) internal successors, (7707), 6220 states have internal predecessors, (7707), 881 states have call successors, (881), 739 states have call predecessors, (881), 914 states have return successors, (1457), 955 states have call predecessors, (1457), 880 states have call successors, (1457) [2025-01-09 06:05:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 10045 transitions. [2025-01-09 06:05:23,609 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 10045 transitions. Word has length 71 [2025-01-09 06:05:23,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:23,609 INFO L471 AbstractCegarLoop]: Abstraction has 7908 states and 10045 transitions. [2025-01-09 06:05:23,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 06:05:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 10045 transitions. [2025-01-09 06:05:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 06:05:23,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:23,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:23,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 06:05:23,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:23,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash -71002034, now seen corresponding path program 1 times [2025-01-09 06:05:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996978173] [2025-01-09 06:05:23,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:23,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:23,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 06:05:23,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 06:05:23,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:23,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 06:05:23,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:23,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996978173] [2025-01-09 06:05:23,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996978173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:23,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:23,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130487261] [2025-01-09 06:05:23,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:23,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:23,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:23,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:23,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:23,705 INFO L87 Difference]: Start difference. First operand 7908 states and 10045 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:05:25,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:25,245 INFO L93 Difference]: Finished difference Result 23172 states and 29336 transitions. [2025-01-09 06:05:25,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 06:05:25,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-01-09 06:05:25,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:25,297 INFO L225 Difference]: With dead ends: 23172 [2025-01-09 06:05:25,298 INFO L226 Difference]: Without dead ends: 15666 [2025-01-09 06:05:25,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-01-09 06:05:25,317 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 761 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:25,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1980 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:05:25,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15666 states. [2025-01-09 06:05:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15666 to 15077. [2025-01-09 06:05:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15077 states, 11509 states have (on average 1.2264314884003824) internal successors, (14115), 11760 states have internal predecessors, (14115), 1720 states have call successors, (1720), 1457 states have call predecessors, (1720), 1846 states have return successors, (3104), 1872 states have call predecessors, (3104), 1719 states have call successors, (3104) [2025-01-09 06:05:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15077 states to 15077 states and 18939 transitions. [2025-01-09 06:05:26,326 INFO L78 Accepts]: Start accepts. Automaton has 15077 states and 18939 transitions. Word has length 80 [2025-01-09 06:05:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:26,327 INFO L471 AbstractCegarLoop]: Abstraction has 15077 states and 18939 transitions. [2025-01-09 06:05:26,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:05:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 15077 states and 18939 transitions. [2025-01-09 06:05:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-01-09 06:05:26,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:26,333 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:26,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 06:05:26,334 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:26,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:26,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1814519410, now seen corresponding path program 1 times [2025-01-09 06:05:26,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:26,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880737632] [2025-01-09 06:05:26,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:26,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:26,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 06:05:26,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 06:05:26,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:26,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 06:05:26,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:26,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880737632] [2025-01-09 06:05:26,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880737632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:26,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:26,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 06:05:26,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167319594] [2025-01-09 06:05:26,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:26,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 06:05:26,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:26,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 06:05:26,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:05:26,451 INFO L87 Difference]: Start difference. First operand 15077 states and 18939 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:05:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:28,187 INFO L93 Difference]: Finished difference Result 26761 states and 33445 transitions. [2025-01-09 06:05:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 06:05:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-01-09 06:05:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:28,232 INFO L225 Difference]: With dead ends: 26761 [2025-01-09 06:05:28,232 INFO L226 Difference]: Without dead ends: 12701 [2025-01-09 06:05:28,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2025-01-09 06:05:28,256 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1657 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:28,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 2044 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 06:05:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12701 states. [2025-01-09 06:05:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12701 to 11939. [2025-01-09 06:05:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11939 states, 9187 states have (on average 1.2155219331664309) internal successors, (11167), 9347 states have internal predecessors, (11167), 1341 states have call successors, (1341), 1131 states have call predecessors, (1341), 1409 states have return successors, (2160), 1470 states have call predecessors, (2160), 1340 states have call successors, (2160) [2025-01-09 06:05:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11939 states to 11939 states and 14668 transitions. [2025-01-09 06:05:28,817 INFO L78 Accepts]: Start accepts. Automaton has 11939 states and 14668 transitions. Word has length 86 [2025-01-09 06:05:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:28,818 INFO L471 AbstractCegarLoop]: Abstraction has 11939 states and 14668 transitions. [2025-01-09 06:05:28,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 06:05:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 11939 states and 14668 transitions. [2025-01-09 06:05:28,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 06:05:28,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:28,830 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:28,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 06:05:28,831 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:28,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1799214237, now seen corresponding path program 1 times [2025-01-09 06:05:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:28,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546735933] [2025-01-09 06:05:28,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:28,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:28,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 06:05:28,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 06:05:28,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:28,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 17 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 06:05:28,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546735933] [2025-01-09 06:05:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546735933] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:05:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658528374] [2025-01-09 06:05:28,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:28,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:28,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:28,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:05:28,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 06:05:29,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 06:05:29,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 06:05:29,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:29,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:29,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 06:05:29,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:05:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 06:05:29,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:05:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658528374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:29,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:05:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-01-09 06:05:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590763359] [2025-01-09 06:05:29,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:29,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:29,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:29,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:29,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 06:05:29,133 INFO L87 Difference]: Start difference. First operand 11939 states and 14668 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 06:05:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:29,462 INFO L93 Difference]: Finished difference Result 17120 states and 20950 transitions. [2025-01-09 06:05:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:29,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-01-09 06:05:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:29,489 INFO L225 Difference]: With dead ends: 17120 [2025-01-09 06:05:29,489 INFO L226 Difference]: Without dead ends: 5591 [2025-01-09 06:05:29,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 06:05:29,508 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 0 mSDsluCounter, 2855 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3571 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:29,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3571 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2025-01-09 06:05:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5399. [2025-01-09 06:05:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5399 states, 4264 states have (on average 1.2199812382739212) internal successors, (5202), 4322 states have internal predecessors, (5202), 548 states have call successors, (548), 438 states have call predecessors, (548), 585 states have return successors, (881), 639 states have call predecessors, (881), 547 states have call successors, (881) [2025-01-09 06:05:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 6631 transitions. [2025-01-09 06:05:29,747 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 6631 transitions. Word has length 139 [2025-01-09 06:05:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:29,748 INFO L471 AbstractCegarLoop]: Abstraction has 5399 states and 6631 transitions. [2025-01-09 06:05:29,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 06:05:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 6631 transitions. [2025-01-09 06:05:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 06:05:29,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:29,754 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:29,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 06:05:29,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:29,956 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:29,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:29,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1912531667, now seen corresponding path program 1 times [2025-01-09 06:05:29,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:29,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230529243] [2025-01-09 06:05:29,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:29,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:29,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 06:05:29,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 06:05:29,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:29,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 06:05:30,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:30,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230529243] [2025-01-09 06:05:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230529243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:30,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:30,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301908984] [2025-01-09 06:05:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:30,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:30,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:30,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:30,016 INFO L87 Difference]: Start difference. First operand 5399 states and 6631 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 06:05:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:30,224 INFO L93 Difference]: Finished difference Result 5716 states and 7005 transitions. [2025-01-09 06:05:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:30,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 141 [2025-01-09 06:05:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:30,250 INFO L225 Difference]: With dead ends: 5716 [2025-01-09 06:05:30,250 INFO L226 Difference]: Without dead ends: 4985 [2025-01-09 06:05:30,253 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:05:30,253 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 120 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1310 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:05:30,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1310 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2025-01-09 06:05:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 4985. [2025-01-09 06:05:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 3949 states have (on average 1.2238541402886807) internal successors, (4833), 4001 states have internal predecessors, (4833), 502 states have call successors, (502), 398 states have call predecessors, (502), 532 states have return successors, (813), 586 states have call predecessors, (813), 501 states have call successors, (813) [2025-01-09 06:05:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 6148 transitions. [2025-01-09 06:05:30,492 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 6148 transitions. Word has length 141 [2025-01-09 06:05:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:30,492 INFO L471 AbstractCegarLoop]: Abstraction has 4985 states and 6148 transitions. [2025-01-09 06:05:30,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 06:05:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 6148 transitions. [2025-01-09 06:05:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 06:05:30,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:30,501 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:30,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 06:05:30,501 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:30,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash -166595673, now seen corresponding path program 1 times [2025-01-09 06:05:30,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:30,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508370283] [2025-01-09 06:05:30,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:30,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 06:05:30,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 06:05:30,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:30,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-09 06:05:30,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:30,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508370283] [2025-01-09 06:05:30,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508370283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:30,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:30,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:30,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964183413] [2025-01-09 06:05:30,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:30,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:30,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:30,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:30,551 INFO L87 Difference]: Start difference. First operand 4985 states and 6148 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 06:05:30,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:30,738 INFO L93 Difference]: Finished difference Result 6888 states and 8410 transitions. [2025-01-09 06:05:30,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:30,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 151 [2025-01-09 06:05:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:30,755 INFO L225 Difference]: With dead ends: 6888 [2025-01-09 06:05:30,755 INFO L226 Difference]: Without dead ends: 2466 [2025-01-09 06:05:30,762 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:05:30,763 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 681 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:30,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 816 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2025-01-09 06:05:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2466. [2025-01-09 06:05:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 1989 states have (on average 1.244343891402715) internal successors, (2475), 2015 states have internal predecessors, (2475), 234 states have call successors, (234), 178 states have call predecessors, (234), 241 states have return successors, (354), 273 states have call predecessors, (354), 233 states have call successors, (354) [2025-01-09 06:05:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3063 transitions. [2025-01-09 06:05:30,883 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3063 transitions. Word has length 151 [2025-01-09 06:05:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:30,883 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3063 transitions. [2025-01-09 06:05:30,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 06:05:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3063 transitions. [2025-01-09 06:05:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 06:05:30,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:30,887 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:30,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 06:05:30,888 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:30,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:30,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1218528960, now seen corresponding path program 1 times [2025-01-09 06:05:30,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:30,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547818702] [2025-01-09 06:05:30,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:30,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:30,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 06:05:30,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 06:05:30,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:30,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-09 06:05:30,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:30,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547818702] [2025-01-09 06:05:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547818702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:30,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680048428] [2025-01-09 06:05:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:30,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:30,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:30,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:30,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:30,975 INFO L87 Difference]: Start difference. First operand 2466 states and 3063 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 06:05:31,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:31,643 INFO L93 Difference]: Finished difference Result 4182 states and 5116 transitions. [2025-01-09 06:05:31,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:31,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 150 [2025-01-09 06:05:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:31,660 INFO L225 Difference]: With dead ends: 4182 [2025-01-09 06:05:31,661 INFO L226 Difference]: Without dead ends: 2406 [2025-01-09 06:05:31,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 06:05:31,665 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 357 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:31,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1452 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:05:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2025-01-09 06:05:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2009. [2025-01-09 06:05:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2009 states, 1637 states have (on average 1.2602321319486867) internal successors, (2063), 1657 states have internal predecessors, (2063), 188 states have call successors, (188), 142 states have call predecessors, (188), 182 states have return successors, (265), 210 states have call predecessors, (265), 187 states have call successors, (265) [2025-01-09 06:05:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2009 states to 2009 states and 2516 transitions. [2025-01-09 06:05:31,779 INFO L78 Accepts]: Start accepts. Automaton has 2009 states and 2516 transitions. Word has length 150 [2025-01-09 06:05:31,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:31,781 INFO L471 AbstractCegarLoop]: Abstraction has 2009 states and 2516 transitions. [2025-01-09 06:05:31,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 06:05:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2009 states and 2516 transitions. [2025-01-09 06:05:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 06:05:31,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:31,785 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:31,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 06:05:31,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:31,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:31,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2002037046, now seen corresponding path program 1 times [2025-01-09 06:05:31,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:31,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938536168] [2025-01-09 06:05:31,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:31,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 06:05:31,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 06:05:31,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:31,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 06:05:32,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938536168] [2025-01-09 06:05:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938536168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:05:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423153006] [2025-01-09 06:05:32,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:32,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:32,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:32,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:05:32,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 06:05:32,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 06:05:32,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 06:05:32,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:32,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:32,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 06:05:32,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:05:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 06:05:32,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 06:05:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-09 06:05:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423153006] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 06:05:32,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 06:05:32,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-01-09 06:05:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428229258] [2025-01-09 06:05:32,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 06:05:32,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 06:05:32,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:32,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 06:05:32,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 06:05:32,486 INFO L87 Difference]: Start difference. First operand 2009 states and 2516 transitions. Second operand has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-01-09 06:05:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:33,952 INFO L93 Difference]: Finished difference Result 4064 states and 5032 transitions. [2025-01-09 06:05:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 06:05:33,953 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 153 [2025-01-09 06:05:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:33,962 INFO L225 Difference]: With dead ends: 4064 [2025-01-09 06:05:33,962 INFO L226 Difference]: Without dead ends: 2349 [2025-01-09 06:05:33,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 314 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2025-01-09 06:05:33,966 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 1630 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:33,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 2648 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 06:05:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-01-09 06:05:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2078. [2025-01-09 06:05:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 1668 states have (on average 1.235011990407674) internal successors, (2060), 1692 states have internal predecessors, (2060), 208 states have call successors, (208), 164 states have call predecessors, (208), 200 states have return successors, (314), 222 states have call predecessors, (314), 207 states have call successors, (314) [2025-01-09 06:05:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2582 transitions. [2025-01-09 06:05:34,168 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2582 transitions. Word has length 153 [2025-01-09 06:05:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:34,168 INFO L471 AbstractCegarLoop]: Abstraction has 2078 states and 2582 transitions. [2025-01-09 06:05:34,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 6 states have call successors, (36), 7 states have call predecessors, (36), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2025-01-09 06:05:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2582 transitions. [2025-01-09 06:05:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 06:05:34,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:34,173 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:34,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 06:05:34,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:34,374 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1173918628, now seen corresponding path program 1 times [2025-01-09 06:05:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366704878] [2025-01-09 06:05:34,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:34,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 06:05:34,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 06:05:34,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:34,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 06:05:34,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:34,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366704878] [2025-01-09 06:05:34,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366704878] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 06:05:34,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762984392] [2025-01-09 06:05:34,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:34,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 06:05:34,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 06:05:34,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 06:05:34,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 06:05:34,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 06:05:34,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 06:05:34,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:34,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:34,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 06:05:34,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 06:05:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-01-09 06:05:34,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 06:05:34,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762984392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:34,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 06:05:34,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-01-09 06:05:34,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851754495] [2025-01-09 06:05:34,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:34,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:34,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:34,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:34,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 06:05:34,701 INFO L87 Difference]: Start difference. First operand 2078 states and 2582 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 06:05:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:35,411 INFO L93 Difference]: Finished difference Result 3678 states and 4460 transitions. [2025-01-09 06:05:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 06:05:35,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 169 [2025-01-09 06:05:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:35,420 INFO L225 Difference]: With dead ends: 3678 [2025-01-09 06:05:35,420 INFO L226 Difference]: Without dead ends: 1811 [2025-01-09 06:05:35,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 06:05:35,423 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 979 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:35,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1049 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:05:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-01-09 06:05:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1738. [2025-01-09 06:05:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1408 states have (on average 1.2450284090909092) internal successors, (1753), 1422 states have internal predecessors, (1753), 171 states have call successors, (171), 130 states have call predecessors, (171), 157 states have return successors, (240), 186 states have call predecessors, (240), 170 states have call successors, (240) [2025-01-09 06:05:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2164 transitions. [2025-01-09 06:05:35,624 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2164 transitions. Word has length 169 [2025-01-09 06:05:35,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:35,625 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2164 transitions. [2025-01-09 06:05:35,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 06:05:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2164 transitions. [2025-01-09 06:05:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:35,628 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:35,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:35,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 06:05:35,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 06:05:35,829 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:35,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash 451208283, now seen corresponding path program 1 times [2025-01-09 06:05:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643354702] [2025-01-09 06:05:35,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:35,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:35,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:35,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:35,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:35,885 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:05:35,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:35,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643354702] [2025-01-09 06:05:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643354702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:35,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:35,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 06:05:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893059555] [2025-01-09 06:05:35,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:35,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 06:05:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:35,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 06:05:35,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 06:05:35,886 INFO L87 Difference]: Start difference. First operand 1738 states and 2164 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:05:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:36,021 INFO L93 Difference]: Finished difference Result 2100 states and 2735 transitions. [2025-01-09 06:05:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 06:05:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:36,034 INFO L225 Difference]: With dead ends: 2100 [2025-01-09 06:05:36,035 INFO L226 Difference]: Without dead ends: 1738 [2025-01-09 06:05:36,036 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:05:36,036 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 580 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 837 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:05:36,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 837 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 06:05:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2025-01-09 06:05:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1738. [2025-01-09 06:05:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1408 states have (on average 1.2443181818181819) internal successors, (1752), 1422 states have internal predecessors, (1752), 171 states have call successors, (171), 130 states have call predecessors, (171), 157 states have return successors, (240), 186 states have call predecessors, (240), 170 states have call successors, (240) [2025-01-09 06:05:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2163 transitions. [2025-01-09 06:05:36,134 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2163 transitions. Word has length 176 [2025-01-09 06:05:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:36,134 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2163 transitions. [2025-01-09 06:05:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:05:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2163 transitions. [2025-01-09 06:05:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:36,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:36,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:36,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 06:05:36,137 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:36,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash -952660903, now seen corresponding path program 1 times [2025-01-09 06:05:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:36,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586215101] [2025-01-09 06:05:36,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:36,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:36,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:36,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:36,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:36,209 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:05:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:36,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586215101] [2025-01-09 06:05:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586215101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:36,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:36,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:36,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710196086] [2025-01-09 06:05:36,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:36,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:36,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:36,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:36,212 INFO L87 Difference]: Start difference. First operand 1738 states and 2163 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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:05:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:36,760 INFO L93 Difference]: Finished difference Result 2496 states and 3377 transitions. [2025-01-09 06:05:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 06:05:36,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:36,771 INFO L225 Difference]: With dead ends: 2496 [2025-01-09 06:05:36,771 INFO L226 Difference]: Without dead ends: 2141 [2025-01-09 06:05:36,772 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:05:36,773 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 1308 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:36,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 1783 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:05:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2025-01-09 06:05:36,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 2112. [2025-01-09 06:05:36,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1754 states have (on average 1.314709236031927) internal successors, (2306), 1769 states have internal predecessors, (2306), 192 states have call successors, (192), 136 states have call predecessors, (192), 164 states have return successors, (262), 207 states have call predecessors, (262), 191 states have call successors, (262) [2025-01-09 06:05:36,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2760 transitions. [2025-01-09 06:05:36,877 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2760 transitions. Word has length 176 [2025-01-09 06:05:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:36,877 INFO L471 AbstractCegarLoop]: Abstraction has 2112 states and 2760 transitions. [2025-01-09 06:05:36,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 4 states have internal predecessors, (166), 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:05:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2760 transitions. [2025-01-09 06:05:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:36,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:36,879 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:36,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 06:05:36,880 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:36,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1039721437, now seen corresponding path program 1 times [2025-01-09 06:05:36,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:36,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122268033] [2025-01-09 06:05:36,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:36,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:36,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:36,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:36,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:36,990 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:05:36,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:36,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122268033] [2025-01-09 06:05:36,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122268033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:36,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:36,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:36,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703196890] [2025-01-09 06:05:36,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:36,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:36,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:36,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:36,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:36,992 INFO L87 Difference]: Start difference. First operand 2112 states and 2760 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:37,825 INFO L93 Difference]: Finished difference Result 3316 states and 4706 transitions. [2025-01-09 06:05:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:37,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:37,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:37,840 INFO L225 Difference]: With dead ends: 3316 [2025-01-09 06:05:37,840 INFO L226 Difference]: Without dead ends: 2587 [2025-01-09 06:05:37,842 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:05:37,843 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 1315 mSDsluCounter, 2507 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:37,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 3335 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:05:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-01-09 06:05:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2458. [2025-01-09 06:05:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 2072 states have (on average 1.3532818532818534) internal successors, (2804), 2088 states have internal predecessors, (2804), 213 states have call successors, (213), 142 states have call predecessors, (213), 171 states have return successors, (286), 229 states have call predecessors, (286), 212 states have call successors, (286) [2025-01-09 06:05:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 3303 transitions. [2025-01-09 06:05:38,003 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 3303 transitions. Word has length 176 [2025-01-09 06:05:38,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:38,003 INFO L471 AbstractCegarLoop]: Abstraction has 2458 states and 3303 transitions. [2025-01-09 06:05:38,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3303 transitions. [2025-01-09 06:05:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:38,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:38,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:38,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 06:05:38,006 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:38,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:38,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1808664993, now seen corresponding path program 1 times [2025-01-09 06:05:38,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:38,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567850766] [2025-01-09 06:05:38,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:38,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:38,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:38,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:38,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:38,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:38,098 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:05:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567850766] [2025-01-09 06:05:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567850766] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:38,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262626342] [2025-01-09 06:05:38,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:38,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:38,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:38,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:38,100 INFO L87 Difference]: Start difference. First operand 2458 states and 3303 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:38,538 INFO L93 Difference]: Finished difference Result 3653 states and 5238 transitions. [2025-01-09 06:05:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:38,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:38,553 INFO L225 Difference]: With dead ends: 3653 [2025-01-09 06:05:38,553 INFO L226 Difference]: Without dead ends: 2578 [2025-01-09 06:05:38,556 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:05:38,557 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 968 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:38,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1329 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:05:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2025-01-09 06:05:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2458. [2025-01-09 06:05:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 2072 states have (on average 1.3518339768339769) internal successors, (2801), 2088 states have internal predecessors, (2801), 213 states have call successors, (213), 142 states have call predecessors, (213), 171 states have return successors, (286), 229 states have call predecessors, (286), 212 states have call successors, (286) [2025-01-09 06:05:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 3300 transitions. [2025-01-09 06:05:38,693 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 3300 transitions. Word has length 176 [2025-01-09 06:05:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:38,694 INFO L471 AbstractCegarLoop]: Abstraction has 2458 states and 3300 transitions. [2025-01-09 06:05:38,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3300 transitions. [2025-01-09 06:05:38,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:38,696 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:38,696 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:38,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 06:05:38,696 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:38,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1563134877, now seen corresponding path program 1 times [2025-01-09 06:05:38,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:38,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265440700] [2025-01-09 06:05:38,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:38,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:38,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:38,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:38,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 06:05:38,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:38,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265440700] [2025-01-09 06:05:38,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265440700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:38,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:38,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443066225] [2025-01-09 06:05:38,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:38,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:38,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:38,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:38,786 INFO L87 Difference]: Start difference. First operand 2458 states and 3300 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:39,307 INFO L93 Difference]: Finished difference Result 3648 states and 5222 transitions. [2025-01-09 06:05:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:39,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:39,323 INFO L225 Difference]: With dead ends: 3648 [2025-01-09 06:05:39,324 INFO L226 Difference]: Without dead ends: 2573 [2025-01-09 06:05:39,327 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:05:39,327 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 965 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:39,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1321 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:05:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2025-01-09 06:05:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2458. [2025-01-09 06:05:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 2072 states have (on average 1.3503861003861004) internal successors, (2798), 2088 states have internal predecessors, (2798), 213 states have call successors, (213), 142 states have call predecessors, (213), 171 states have return successors, (286), 229 states have call predecessors, (286), 212 states have call successors, (286) [2025-01-09 06:05:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 3297 transitions. [2025-01-09 06:05:39,515 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 3297 transitions. Word has length 176 [2025-01-09 06:05:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:39,515 INFO L471 AbstractCegarLoop]: Abstraction has 2458 states and 3297 transitions. [2025-01-09 06:05:39,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:39,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 3297 transitions. [2025-01-09 06:05:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:39,518 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:39,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:39,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 06:05:39,519 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:39,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1948997279, now seen corresponding path program 1 times [2025-01-09 06:05:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:39,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086071486] [2025-01-09 06:05:39,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:39,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:39,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:39,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:39,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:39,657 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:05:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086071486] [2025-01-09 06:05:39,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086071486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:39,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:39,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889035625] [2025-01-09 06:05:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:39,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:39,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:39,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:39,659 INFO L87 Difference]: Start difference. First operand 2458 states and 3297 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:40,584 INFO L93 Difference]: Finished difference Result 4405 states and 6418 transitions. [2025-01-09 06:05:40,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:40,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:40,601 INFO L225 Difference]: With dead ends: 4405 [2025-01-09 06:05:40,601 INFO L226 Difference]: Without dead ends: 3330 [2025-01-09 06:05:40,606 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:05:40,606 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 1294 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 3281 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:40,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 3281 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:05:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2025-01-09 06:05:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3191. [2025-01-09 06:05:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 2747 states have (on average 1.4069894430287586) internal successors, (3865), 2767 states have internal predecessors, (3865), 255 states have call successors, (255), 154 states have call predecessors, (255), 187 states have return successors, (340), 273 states have call predecessors, (340), 254 states have call successors, (340) [2025-01-09 06:05:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4460 transitions. [2025-01-09 06:05:40,855 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4460 transitions. Word has length 176 [2025-01-09 06:05:40,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:40,855 INFO L471 AbstractCegarLoop]: Abstraction has 3191 states and 4460 transitions. [2025-01-09 06:05:40,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4460 transitions. [2025-01-09 06:05:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:40,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:40,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:40,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 06:05:40,860 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:40,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1684349789, now seen corresponding path program 1 times [2025-01-09 06:05:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978363932] [2025-01-09 06:05:40,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:40,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:40,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:40,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:40,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:40,988 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:05:40,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978363932] [2025-01-09 06:05:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978363932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:40,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:40,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:40,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147141589] [2025-01-09 06:05:40,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:40,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:40,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:40,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:40,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:40,990 INFO L87 Difference]: Start difference. First operand 3191 states and 4460 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:41,519 INFO L93 Difference]: Finished difference Result 5230 states and 7772 transitions. [2025-01-09 06:05:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:41,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:41,538 INFO L225 Difference]: With dead ends: 5230 [2025-01-09 06:05:41,538 INFO L226 Difference]: Without dead ends: 3422 [2025-01-09 06:05:41,543 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:05:41,543 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 961 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:41,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 1307 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:05:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2025-01-09 06:05:41,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3191. [2025-01-09 06:05:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 2747 states have (on average 1.4051692755733527) internal successors, (3860), 2767 states have internal predecessors, (3860), 255 states have call successors, (255), 154 states have call predecessors, (255), 187 states have return successors, (340), 273 states have call predecessors, (340), 254 states have call successors, (340) [2025-01-09 06:05:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4455 transitions. [2025-01-09 06:05:41,787 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4455 transitions. Word has length 176 [2025-01-09 06:05:41,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:41,787 INFO L471 AbstractCegarLoop]: Abstraction has 3191 states and 4455 transitions. [2025-01-09 06:05:41,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:41,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4455 transitions. [2025-01-09 06:05:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:41,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:41,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:41,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 06:05:41,791 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:41,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:41,791 INFO L85 PathProgramCache]: Analyzing trace with hash -679491873, now seen corresponding path program 1 times [2025-01-09 06:05:41,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:41,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760139654] [2025-01-09 06:05:41,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:41,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:41,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:41,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:41,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:41,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:41,921 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:05:41,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:41,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760139654] [2025-01-09 06:05:41,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760139654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:41,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864498225] [2025-01-09 06:05:41,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:41,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:41,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:41,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:41,923 INFO L87 Difference]: Start difference. First operand 3191 states and 4455 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:42,893 INFO L93 Difference]: Finished difference Result 6748 states and 10184 transitions. [2025-01-09 06:05:42,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:42,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:42,915 INFO L225 Difference]: With dead ends: 6748 [2025-01-09 06:05:42,915 INFO L226 Difference]: Without dead ends: 4940 [2025-01-09 06:05:42,921 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:05:42,922 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 1315 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:42,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 2367 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:05:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2025-01-09 06:05:43,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4771. [2025-01-09 06:05:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4771 states, 4205 states have (on average 1.4739595719381688) internal successors, (6198), 4239 states have internal predecessors, (6198), 339 states have call successors, (339), 178 states have call predecessors, (339), 225 states have return successors, (472), 361 states have call predecessors, (472), 338 states have call successors, (472) [2025-01-09 06:05:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 7009 transitions. [2025-01-09 06:05:43,210 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 7009 transitions. Word has length 176 [2025-01-09 06:05:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:43,210 INFO L471 AbstractCegarLoop]: Abstraction has 4771 states and 7009 transitions. [2025-01-09 06:05:43,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:43,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 7009 transitions. [2025-01-09 06:05:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:43,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:43,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 06:05:43,213 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2002670819, now seen corresponding path program 1 times [2025-01-09 06:05:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023344345] [2025-01-09 06:05:43,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:43,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:43,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:43,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:43,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:43,312 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:05:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023344345] [2025-01-09 06:05:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023344345] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:43,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:43,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343734807] [2025-01-09 06:05:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:43,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:43,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:43,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:43,315 INFO L87 Difference]: Start difference. First operand 4771 states and 7009 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:44,104 INFO L93 Difference]: Finished difference Result 8710 states and 13512 transitions. [2025-01-09 06:05:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:44,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:44,127 INFO L225 Difference]: With dead ends: 8710 [2025-01-09 06:05:44,127 INFO L226 Difference]: Without dead ends: 5322 [2025-01-09 06:05:44,138 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:05:44,138 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 957 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:44,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 1293 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 06:05:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2025-01-09 06:05:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 4771. [2025-01-09 06:05:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4771 states, 4205 states have (on average 1.4718192627824018) internal successors, (6189), 4239 states have internal predecessors, (6189), 339 states have call successors, (339), 178 states have call predecessors, (339), 225 states have return successors, (472), 361 states have call predecessors, (472), 338 states have call successors, (472) [2025-01-09 06:05:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 7000 transitions. [2025-01-09 06:05:44,436 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 7000 transitions. Word has length 176 [2025-01-09 06:05:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:44,436 INFO L471 AbstractCegarLoop]: Abstraction has 4771 states and 7000 transitions. [2025-01-09 06:05:44,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 7000 transitions. [2025-01-09 06:05:44,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:44,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:44,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:44,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 06:05:44,439 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash -105691361, now seen corresponding path program 1 times [2025-01-09 06:05:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095520716] [2025-01-09 06:05:44,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:44,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:44,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:44,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:44,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:44,539 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:05:44,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:44,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095520716] [2025-01-09 06:05:44,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095520716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:44,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:44,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:44,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921231061] [2025-01-09 06:05:44,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:44,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:44,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:44,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:44,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:44,540 INFO L87 Difference]: Start difference. First operand 4771 states and 7000 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:45,083 INFO L93 Difference]: Finished difference Result 8652 states and 13378 transitions. [2025-01-09 06:05:45,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:45,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:45,100 INFO L225 Difference]: With dead ends: 8652 [2025-01-09 06:05:45,100 INFO L226 Difference]: Without dead ends: 5264 [2025-01-09 06:05:45,105 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:05:45,106 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 953 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:45,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1279 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:05:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states. [2025-01-09 06:05:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 4771. [2025-01-09 06:05:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4771 states, 4205 states have (on average 1.469678953626635) internal successors, (6180), 4239 states have internal predecessors, (6180), 339 states have call successors, (339), 178 states have call predecessors, (339), 225 states have return successors, (472), 361 states have call predecessors, (472), 338 states have call successors, (472) [2025-01-09 06:05:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 6991 transitions. [2025-01-09 06:05:45,391 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 6991 transitions. Word has length 176 [2025-01-09 06:05:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:45,391 INFO L471 AbstractCegarLoop]: Abstraction has 4771 states and 6991 transitions. [2025-01-09 06:05:45,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 6991 transitions. [2025-01-09 06:05:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:45,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:45,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:45,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 06:05:45,394 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:45,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash 320863137, now seen corresponding path program 1 times [2025-01-09 06:05:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:45,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124112820] [2025-01-09 06:05:45,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:45,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:45,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:45,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:45,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:45,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:45,468 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:05:45,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:45,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124112820] [2025-01-09 06:05:45,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124112820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:45,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:45,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:45,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926059612] [2025-01-09 06:05:45,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:45,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:45,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:45,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:45,469 INFO L87 Difference]: Start difference. First operand 4771 states and 6991 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:46,067 INFO L93 Difference]: Finished difference Result 8623 states and 13302 transitions. [2025-01-09 06:05:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:46,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:46,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:46,085 INFO L225 Difference]: With dead ends: 8623 [2025-01-09 06:05:46,086 INFO L226 Difference]: Without dead ends: 5235 [2025-01-09 06:05:46,092 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:05:46,093 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 950 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:46,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1271 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:05:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2025-01-09 06:05:46,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 4771. [2025-01-09 06:05:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4771 states, 4205 states have (on average 1.467538644470868) internal successors, (6171), 4239 states have internal predecessors, (6171), 339 states have call successors, (339), 178 states have call predecessors, (339), 225 states have return successors, (472), 361 states have call predecessors, (472), 338 states have call successors, (472) [2025-01-09 06:05:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 6982 transitions. [2025-01-09 06:05:46,381 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 6982 transitions. Word has length 176 [2025-01-09 06:05:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:46,382 INFO L471 AbstractCegarLoop]: Abstraction has 4771 states and 6982 transitions. [2025-01-09 06:05:46,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 6982 transitions. [2025-01-09 06:05:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:46,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:46,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:46,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 06:05:46,385 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:46,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash -219566369, now seen corresponding path program 1 times [2025-01-09 06:05:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:46,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543300177] [2025-01-09 06:05:46,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:46,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:46,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:46,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:46,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:46,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:46,481 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:05:46,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:46,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543300177] [2025-01-09 06:05:46,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543300177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:46,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:46,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:46,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540862448] [2025-01-09 06:05:46,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:46,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:46,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:46,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:46,482 INFO L87 Difference]: Start difference. First operand 4771 states and 6982 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:47,411 INFO L93 Difference]: Finished difference Result 11738 states and 18303 transitions. [2025-01-09 06:05:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:47,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:47,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:47,441 INFO L225 Difference]: With dead ends: 11738 [2025-01-09 06:05:47,441 INFO L226 Difference]: Without dead ends: 8350 [2025-01-09 06:05:47,447 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:05:47,448 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 1249 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 3167 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:47,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 3167 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 06:05:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8350 states. [2025-01-09 06:05:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8350 to 8156. [2025-01-09 06:05:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8156 states, 7328 states have (on average 1.5304312227074235) internal successors, (11215), 7408 states have internal predecessors, (11215), 507 states have call successors, (507), 226 states have call predecessors, (507), 319 states have return successors, (832), 537 states have call predecessors, (832), 506 states have call successors, (832) [2025-01-09 06:05:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 12554 transitions. [2025-01-09 06:05:47,863 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 12554 transitions. Word has length 176 [2025-01-09 06:05:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:47,864 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 12554 transitions. [2025-01-09 06:05:47,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 12554 transitions. [2025-01-09 06:05:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:47,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:47,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:47,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 06:05:47,867 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:47,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash -375546911, now seen corresponding path program 1 times [2025-01-09 06:05:47,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:47,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339801845] [2025-01-09 06:05:47,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:47,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:47,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:47,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:47,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:47,930 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:05:47,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339801845] [2025-01-09 06:05:47,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339801845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:47,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:47,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 06:05:47,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447102083] [2025-01-09 06:05:47,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:47,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 06:05:47,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:47,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 06:05:47,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 06:05:47,931 INFO L87 Difference]: Start difference. First operand 8156 states and 12554 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:48,618 INFO L93 Difference]: Finished difference Result 16091 states and 25870 transitions. [2025-01-09 06:05:48,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 06:05:48,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:48,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:48,651 INFO L225 Difference]: With dead ends: 16091 [2025-01-09 06:05:48,651 INFO L226 Difference]: Without dead ends: 9318 [2025-01-09 06:05:48,663 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:05:48,664 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 944 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:48,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1255 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 06:05:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9318 states. [2025-01-09 06:05:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9318 to 8156. [2025-01-09 06:05:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8156 states, 7328 states have (on average 1.5281113537117903) internal successors, (11198), 7408 states have internal predecessors, (11198), 507 states have call successors, (507), 226 states have call predecessors, (507), 319 states have return successors, (832), 537 states have call predecessors, (832), 506 states have call successors, (832) [2025-01-09 06:05:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8156 states to 8156 states and 12537 transitions. [2025-01-09 06:05:49,133 INFO L78 Accepts]: Start accepts. Automaton has 8156 states and 12537 transitions. Word has length 176 [2025-01-09 06:05:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:49,133 INFO L471 AbstractCegarLoop]: Abstraction has 8156 states and 12537 transitions. [2025-01-09 06:05:49,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 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:05:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8156 states and 12537 transitions. [2025-01-09 06:05:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:49,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:49,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:49,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 06:05:49,137 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:49,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 35063455, now seen corresponding path program 1 times [2025-01-09 06:05:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419517737] [2025-01-09 06:05:49,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:49,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:49,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:49,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:49,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:49,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:49,217 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:05:49,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:49,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419517737] [2025-01-09 06:05:49,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419517737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:49,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:49,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:49,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204381253] [2025-01-09 06:05:49,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:49,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:49,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:49,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:49,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:49,219 INFO L87 Difference]: Start difference. First operand 8156 states and 12537 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:50,718 INFO L93 Difference]: Finished difference Result 23919 states and 38659 transitions. [2025-01-09 06:05:50,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:50,719 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:50,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:50,786 INFO L225 Difference]: With dead ends: 23919 [2025-01-09 06:05:50,787 INFO L226 Difference]: Without dead ends: 17146 [2025-01-09 06:05:50,801 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:05:50,803 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 1579 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 3119 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:50,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 3119 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:05:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17146 states. [2025-01-09 06:05:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17146 to 15462. [2025-01-09 06:05:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15462 states, 14072 states have (on average 1.5812961910176238) internal successors, (22252), 14298 states have internal predecessors, (22252), 827 states have call successors, (827), 322 states have call predecessors, (827), 561 states have return successors, (1920), 873 states have call predecessors, (1920), 826 states have call successors, (1920) [2025-01-09 06:05:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15462 states to 15462 states and 24999 transitions. [2025-01-09 06:05:51,646 INFO L78 Accepts]: Start accepts. Automaton has 15462 states and 24999 transitions. Word has length 176 [2025-01-09 06:05:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:51,646 INFO L471 AbstractCegarLoop]: Abstraction has 15462 states and 24999 transitions. [2025-01-09 06:05:51,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15462 states and 24999 transitions. [2025-01-09 06:05:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:51,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:51,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:51,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 06:05:51,653 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:51,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1752806367, now seen corresponding path program 1 times [2025-01-09 06:05:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:51,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023740231] [2025-01-09 06:05:51,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:51,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:51,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:51,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:51,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:51,753 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:05:51,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:51,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023740231] [2025-01-09 06:05:51,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023740231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:51,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:51,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:51,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43430056] [2025-01-09 06:05:51,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:51,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:51,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:51,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:51,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:51,755 INFO L87 Difference]: Start difference. First operand 15462 states and 24999 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:05:54,055 INFO L93 Difference]: Finished difference Result 48977 states and 82863 transitions. [2025-01-09 06:05:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:05:54,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:05:54,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:05:54,171 INFO L225 Difference]: With dead ends: 48977 [2025-01-09 06:05:54,172 INFO L226 Difference]: Without dead ends: 34898 [2025-01-09 06:05:54,201 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:05:54,202 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1374 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 06:05:54,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 2278 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 06:05:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34898 states. [2025-01-09 06:05:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34898 to 31953. [2025-01-09 06:05:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31953 states, 29293 states have (on average 1.627146417232786) internal successors, (47664), 29973 states have internal predecessors, (47664), 1451 states have call successors, (1451), 514 states have call predecessors, (1451), 1207 states have return successors, (5616), 1529 states have call predecessors, (5616), 1450 states have call successors, (5616) [2025-01-09 06:05:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31953 states to 31953 states and 54731 transitions. [2025-01-09 06:05:56,353 INFO L78 Accepts]: Start accepts. Automaton has 31953 states and 54731 transitions. Word has length 176 [2025-01-09 06:05:56,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:05:56,353 INFO L471 AbstractCegarLoop]: Abstraction has 31953 states and 54731 transitions. [2025-01-09 06:05:56,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:05:56,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31953 states and 54731 transitions. [2025-01-09 06:05:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:05:56,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:05:56,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:05:56,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 06:05:56,363 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:05:56,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:05:56,363 INFO L85 PathProgramCache]: Analyzing trace with hash 406277727, now seen corresponding path program 1 times [2025-01-09 06:05:56,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:05:56,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340741380] [2025-01-09 06:05:56,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:05:56,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:05:56,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:05:56,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:05:56,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:05:56,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:05:56,442 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:05:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:05:56,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340741380] [2025-01-09 06:05:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340741380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:05:56,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:05:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:05:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035047840] [2025-01-09 06:05:56,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:05:56,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:05:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:05:56,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:05:56,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:05:56,444 INFO L87 Difference]: Start difference. First operand 31953 states and 54731 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:00,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:00,359 INFO L93 Difference]: Finished difference Result 105822 states and 190609 transitions. [2025-01-09 06:06:00,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:00,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:06:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:00,745 INFO L225 Difference]: With dead ends: 105822 [2025-01-09 06:06:00,745 INFO L226 Difference]: Without dead ends: 75252 [2025-01-09 06:06:01,024 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:01,024 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 1510 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1553 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:01,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1553 Valid, 3099 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 06:06:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75252 states. [2025-01-09 06:06:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75252 to 69942. [2025-01-09 06:06:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69942 states, 64288 states have (on average 1.6665629666500748) internal successors, (107140), 66362 states have internal predecessors, (107140), 2667 states have call successors, (2667), 898 states have call predecessors, (2667), 2985 states have return successors, (19120), 2809 states have call predecessors, (19120), 2666 states have call successors, (19120) [2025-01-09 06:06:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69942 states to 69942 states and 128927 transitions. [2025-01-09 06:06:06,460 INFO L78 Accepts]: Start accepts. Automaton has 69942 states and 128927 transitions. Word has length 176 [2025-01-09 06:06:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 06:06:06,460 INFO L471 AbstractCegarLoop]: Abstraction has 69942 states and 128927 transitions. [2025-01-09 06:06:06,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 69942 states and 128927 transitions. [2025-01-09 06:06:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 06:06:06,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 06:06:06,477 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 06:06:06,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 06:06:06,477 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 06:06:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 06:06:06,478 INFO L85 PathProgramCache]: Analyzing trace with hash 475925601, now seen corresponding path program 1 times [2025-01-09 06:06:06,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 06:06:06,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756044900] [2025-01-09 06:06:06,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 06:06:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 06:06:06,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 06:06:06,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 06:06:06,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 06:06:06,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 06:06:06,556 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:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 06:06:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756044900] [2025-01-09 06:06:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756044900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 06:06:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 06:06:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 06:06:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676007148] [2025-01-09 06:06:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 06:06:06,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 06:06:06,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 06:06:06,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 06:06:06,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 06:06:06,557 INFO L87 Difference]: Start difference. First operand 69942 states and 128927 transitions. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 06:06:15,404 INFO L93 Difference]: Finished difference Result 234455 states and 461707 transitions. [2025-01-09 06:06:15,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 06:06:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 5 states have internal predecessors, (166), 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 176 [2025-01-09 06:06:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 06:06:16,086 INFO L225 Difference]: With dead ends: 234455 [2025-01-09 06:06:16,086 INFO L226 Difference]: Without dead ends: 165896 [2025-01-09 06:06:16,306 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:16,306 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 1291 mSDsluCounter, 2312 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 06:06:16,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 3073 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 06:06:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165896 states.