./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7ec37a095871269c822e7d35e6d840f2de134a68f657807281a5c0e96980df26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:12:29,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:12:29,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:12:29,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:12:29,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:12:29,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:12:29,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:12:29,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:12:29,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:12:29,799 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:12:29,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:12:29,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:12:29,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:12:29,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:12:29,799 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:12:29,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:12:29,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:12:29,800 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:12:29,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:12:29,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:12:29,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:12:29,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:12:29,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:12:29,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:12:29,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:12:29,801 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:12:29,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:12:29,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:12:29,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:12:29,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:12:29,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:12:29,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:12:29,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:12:29,802 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 -> 7ec37a095871269c822e7d35e6d840f2de134a68f657807281a5c0e96980df26 [2025-02-05 17:12:30,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:12:30,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:12:30,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:12:30,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:12:30,050 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:12:30,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c [2025-02-05 17:12:31,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5505ff90c/09bf7463f479443d8fad382692c90cb9/FLAG85181d528 [2025-02-05 17:12:31,974 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:12:31,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c [2025-02-05 17:12:32,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5505ff90c/09bf7463f479443d8fad382692c90cb9/FLAG85181d528 [2025-02-05 17:12:32,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5505ff90c/09bf7463f479443d8fad382692c90cb9 [2025-02-05 17:12:32,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:12:32,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:12:32,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:12:32,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:12:32,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:12:32,047 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:12:32" (1/1) ... [2025-02-05 17:12:32,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2854d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:32, skipping insertion in model container [2025-02-05 17:12:32,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:12:32" (1/1) ... [2025-02-05 17:12:32,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:12:33,312 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/Problem05_label45+token_ring.03.cil-1.c[380323,380336] [2025-02-05 17:12:33,344 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/Problem05_label45+token_ring.03.cil-1.c[383339,383352] [2025-02-05 17:12:33,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:12:33,538 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:12:34,063 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/Problem05_label45+token_ring.03.cil-1.c[380323,380336] [2025-02-05 17:12:34,067 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/Problem05_label45+token_ring.03.cil-1.c[383339,383352] [2025-02-05 17:12:34,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:12:34,114 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:12:34,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34 WrapperNode [2025-02-05 17:12:34,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:12:34,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:12:34,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:12:34,116 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:12:34,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,392 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12678 [2025-02-05 17:12:34,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:12:34,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:12:34,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:12:34,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:12:34,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,549 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:12:34,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:12:34,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:12:34,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:12:34,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:12:34,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (1/1) ... [2025-02-05 17:12:34,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:12:34,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:34,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:12:34,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:12:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:12:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:12:34,939 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:12:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:12:34,939 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:12:34,939 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:12:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:12:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:12:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:12:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:12:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:12:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:12:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:12:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:12:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:12:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:12:34,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:12:34,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:12:35,004 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:12:35,005 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:12:41,165 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:12:41,166 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:12:41,167 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:12:41,167 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:12:41,168 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:12:41,168 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:12:41,169 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:12:41,419 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2025-02-05 17:12:41,419 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:12:41,533 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:12:41,538 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:12:41,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:12:41 BoogieIcfgContainer [2025-02-05 17:12:41,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:12:41,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:12:41,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:12:41,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:12:41,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:12:32" (1/3) ... [2025-02-05 17:12:41,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e143206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:12:41, skipping insertion in model container [2025-02-05 17:12:41,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:34" (2/3) ... [2025-02-05 17:12:41,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e143206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:12:41, skipping insertion in model container [2025-02-05 17:12:41,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:12:41" (3/3) ... [2025-02-05 17:12:41,577 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.03.cil-1.c [2025-02-05 17:12:41,607 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:12:41,615 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.03.cil-1.c that has 8 procedures, 2356 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-02-05 17:12:41,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:12:41,705 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;@51da172b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:12:41,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:12:41,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 2356 states, 2327 states have (on average 1.8500214868929952) internal successors, (4305), 2332 states have internal predecessors, (4305), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-02-05 17:12:41,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:12:41,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:41,720 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] [2025-02-05 17:12:41,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:41,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash 27118073, now seen corresponding path program 1 times [2025-02-05 17:12:41,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:41,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184837556] [2025-02-05 17:12:41,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:41,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:41,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:12:41,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:12:41,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:41,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184837556] [2025-02-05 17:12:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184837556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:42,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981188523] [2025-02-05 17:12:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:42,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:42,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:42,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:42,072 INFO L87 Difference]: Start difference. First operand has 2356 states, 2327 states have (on average 1.8500214868929952) internal successors, (4305), 2332 states have internal predecessors, (4305), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:42,515 INFO L93 Difference]: Finished difference Result 4871 states and 8935 transitions. [2025-02-05 17:12:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:12:42,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 17:12:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:42,545 INFO L225 Difference]: With dead ends: 4871 [2025-02-05 17:12:42,545 INFO L226 Difference]: Without dead ends: 2456 [2025-02-05 17:12:42,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:42,563 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 4433 mSDsluCounter, 8538 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4444 SdHoareTripleChecker+Valid, 12759 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:42,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4444 Valid, 12759 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:12:42,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2025-02-05 17:12:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2443. [2025-02-05 17:12:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2397 states have (on average 1.824363788068419) internal successors, (4373), 2401 states have internal predecessors, (4373), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-02-05 17:12:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 4434 transitions. [2025-02-05 17:12:42,715 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 4434 transitions. Word has length 80 [2025-02-05 17:12:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:42,715 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 4434 transitions. [2025-02-05 17:12:42,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:42,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 4434 transitions. [2025-02-05 17:12:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:12:42,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:42,720 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] [2025-02-05 17:12:42,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:12:42,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:42,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1553881463, now seen corresponding path program 1 times [2025-02-05 17:12:42,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:42,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066109738] [2025-02-05 17:12:42,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:42,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:42,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:12:42,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:12:42,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:42,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:42,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:42,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066109738] [2025-02-05 17:12:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066109738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:42,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132800866] [2025-02-05 17:12:42,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:42,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:42,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:42,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:42,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:42,928 INFO L87 Difference]: Start difference. First operand 2443 states and 4434 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:43,156 INFO L93 Difference]: Finished difference Result 2778 states and 4939 transitions. [2025-02-05 17:12:43,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:43,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 17:12:43,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:43,165 INFO L225 Difference]: With dead ends: 2778 [2025-02-05 17:12:43,165 INFO L226 Difference]: Without dead ends: 2467 [2025-02-05 17:12:43,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:43,167 INFO L435 NwaCegarLoop]: 4140 mSDtfsCounter, 4261 mSDsluCounter, 8211 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4272 SdHoareTripleChecker+Valid, 12351 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:43,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4272 Valid, 12351 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:12:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2025-02-05 17:12:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2443. [2025-02-05 17:12:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2397 states have (on average 1.8235294117647058) internal successors, (4371), 2401 states have internal predecessors, (4371), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-02-05 17:12:43,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 4432 transitions. [2025-02-05 17:12:43,219 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 4432 transitions. Word has length 80 [2025-02-05 17:12:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:43,219 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 4432 transitions. [2025-02-05 17:12:43,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 4432 transitions. [2025-02-05 17:12:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:12:43,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:43,220 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] [2025-02-05 17:12:43,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:12:43,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:43,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:43,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1436692104, now seen corresponding path program 1 times [2025-02-05 17:12:43,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:43,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585487272] [2025-02-05 17:12:43,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:43,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:43,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:12:43,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:12:43,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:43,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:43,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:43,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585487272] [2025-02-05 17:12:43,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585487272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:43,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:43,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:43,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026527783] [2025-02-05 17:12:43,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:43,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:43,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:43,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:43,323 INFO L87 Difference]: Start difference. First operand 2443 states and 4432 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:43,740 INFO L93 Difference]: Finished difference Result 2935 states and 5159 transitions. [2025-02-05 17:12:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:43,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 17:12:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:43,753 INFO L225 Difference]: With dead ends: 2935 [2025-02-05 17:12:43,757 INFO L226 Difference]: Without dead ends: 2624 [2025-02-05 17:12:43,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:12:43,759 INFO L435 NwaCegarLoop]: 4271 mSDtfsCounter, 4346 mSDsluCounter, 12798 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4357 SdHoareTripleChecker+Valid, 17069 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:43,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4357 Valid, 17069 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:12:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-02-05 17:12:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2587. [2025-02-05 17:12:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2587 states, 2522 states have (on average 1.8053132434575734) internal successors, (4553), 2527 states have internal predecessors, (4553), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-02-05 17:12:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2587 states to 2587 states and 4641 transitions. [2025-02-05 17:12:43,806 INFO L78 Accepts]: Start accepts. Automaton has 2587 states and 4641 transitions. Word has length 80 [2025-02-05 17:12:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:43,806 INFO L471 AbstractCegarLoop]: Abstraction has 2587 states and 4641 transitions. [2025-02-05 17:12:43,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2587 states and 4641 transitions. [2025-02-05 17:12:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:12:43,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:43,808 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] [2025-02-05 17:12:43,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:12:43,808 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1645390407, now seen corresponding path program 1 times [2025-02-05 17:12:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603644633] [2025-02-05 17:12:43,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:43,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:12:43,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:12:43,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:43,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:43,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:43,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603644633] [2025-02-05 17:12:43,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603644633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:43,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:43,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:43,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528199290] [2025-02-05 17:12:43,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:43,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:43,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:43,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:43,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:43,905 INFO L87 Difference]: Start difference. First operand 2587 states and 4641 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:44,284 INFO L93 Difference]: Finished difference Result 3429 states and 5882 transitions. [2025-02-05 17:12:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:44,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 17:12:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:44,294 INFO L225 Difference]: With dead ends: 3429 [2025-02-05 17:12:44,294 INFO L226 Difference]: Without dead ends: 2974 [2025-02-05 17:12:44,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:12:44,297 INFO L435 NwaCegarLoop]: 4265 mSDtfsCounter, 4445 mSDsluCounter, 12775 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4460 SdHoareTripleChecker+Valid, 17040 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:44,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4460 Valid, 17040 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:12:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2974 states. [2025-02-05 17:12:44,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2974 to 2878. [2025-02-05 17:12:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2775 states have (on average 1.7744144144144145) internal successors, (4924), 2784 states have internal predecessors, (4924), 65 states have call successors, (65), 31 states have call predecessors, (65), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-02-05 17:12:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 5068 transitions. [2025-02-05 17:12:44,362 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 5068 transitions. Word has length 80 [2025-02-05 17:12:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:44,362 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 5068 transitions. [2025-02-05 17:12:44,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 5068 transitions. [2025-02-05 17:12:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:12:44,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:44,363 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] [2025-02-05 17:12:44,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:12:44,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:44,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash 841729368, now seen corresponding path program 1 times [2025-02-05 17:12:44,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:44,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99290272] [2025-02-05 17:12:44,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:44,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:12:44,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:12:44,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:44,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:44,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:44,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99290272] [2025-02-05 17:12:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99290272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:44,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:44,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:44,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678064637] [2025-02-05 17:12:44,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:44,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:44,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:44,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:44,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:44,447 INFO L87 Difference]: Start difference. First operand 2878 states and 5068 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:44,629 INFO L93 Difference]: Finished difference Result 3668 states and 6244 transitions. [2025-02-05 17:12:44,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:44,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 17:12:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:44,639 INFO L225 Difference]: With dead ends: 3668 [2025-02-05 17:12:44,639 INFO L226 Difference]: Without dead ends: 2922 [2025-02-05 17:12:44,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:44,641 INFO L435 NwaCegarLoop]: 4131 mSDtfsCounter, 4253 mSDsluCounter, 8192 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4264 SdHoareTripleChecker+Valid, 12323 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:44,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4264 Valid, 12323 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:12:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-02-05 17:12:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2878. [2025-02-05 17:12:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2775 states have (on average 1.7726126126126127) internal successors, (4919), 2784 states have internal predecessors, (4919), 65 states have call successors, (65), 31 states have call predecessors, (65), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-02-05 17:12:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 5063 transitions. [2025-02-05 17:12:44,704 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 5063 transitions. Word has length 80 [2025-02-05 17:12:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:44,704 INFO L471 AbstractCegarLoop]: Abstraction has 2878 states and 5063 transitions. [2025-02-05 17:12:44,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 5063 transitions. [2025-02-05 17:12:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:12:44,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:44,706 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] [2025-02-05 17:12:44,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:12:44,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:44,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -324966951, now seen corresponding path program 1 times [2025-02-05 17:12:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:44,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015367377] [2025-02-05 17:12:44,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:44,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:44,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:12:44,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:12:44,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:44,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:44,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015367377] [2025-02-05 17:12:44,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015367377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:44,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145057853] [2025-02-05 17:12:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:44,874 INFO L87 Difference]: Start difference. First operand 2878 states and 5063 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:45,310 INFO L93 Difference]: Finished difference Result 4306 states and 7162 transitions. [2025-02-05 17:12:45,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:45,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 17:12:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:45,324 INFO L225 Difference]: With dead ends: 4306 [2025-02-05 17:12:45,324 INFO L226 Difference]: Without dead ends: 3560 [2025-02-05 17:12:45,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:12:45,327 INFO L435 NwaCegarLoop]: 4257 mSDtfsCounter, 4372 mSDsluCounter, 12752 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 17009 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:45,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 17009 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:12:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2025-02-05 17:12:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3466. [2025-02-05 17:12:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 3283 states have (on average 1.7231190983856228) internal successors, (5657), 3306 states have internal predecessors, (5657), 107 states have call successors, (107), 55 states have call predecessors, (107), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-02-05 17:12:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 5933 transitions. [2025-02-05 17:12:45,435 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 5933 transitions. Word has length 80 [2025-02-05 17:12:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:45,435 INFO L471 AbstractCegarLoop]: Abstraction has 3466 states and 5933 transitions. [2025-02-05 17:12:45,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 5933 transitions. [2025-02-05 17:12:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:12:45,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:45,437 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] [2025-02-05 17:12:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:12:45,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:45,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash -224054984, now seen corresponding path program 1 times [2025-02-05 17:12:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:45,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607970786] [2025-02-05 17:12:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:45,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:12:45,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:12:45,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:45,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:45,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:45,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607970786] [2025-02-05 17:12:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607970786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:45,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084037182] [2025-02-05 17:12:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:45,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:45,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:45,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:45,500 INFO L87 Difference]: Start difference. First operand 3466 states and 5933 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:45,702 INFO L93 Difference]: Finished difference Result 4858 states and 8004 transitions. [2025-02-05 17:12:45,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:45,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 17:12:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:45,715 INFO L225 Difference]: With dead ends: 4858 [2025-02-05 17:12:45,716 INFO L226 Difference]: Without dead ends: 3524 [2025-02-05 17:12:45,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:45,720 INFO L435 NwaCegarLoop]: 4126 mSDtfsCounter, 4249 mSDsluCounter, 8183 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4260 SdHoareTripleChecker+Valid, 12309 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:45,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4260 Valid, 12309 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:12:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2025-02-05 17:12:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 3466. [2025-02-05 17:12:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 3283 states have (on average 1.720377703320134) internal successors, (5648), 3306 states have internal predecessors, (5648), 107 states have call successors, (107), 55 states have call predecessors, (107), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-02-05 17:12:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 5924 transitions. [2025-02-05 17:12:45,812 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 5924 transitions. Word has length 80 [2025-02-05 17:12:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:45,812 INFO L471 AbstractCegarLoop]: Abstraction has 3466 states and 5924 transitions. [2025-02-05 17:12:45,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 5924 transitions. [2025-02-05 17:12:45,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 17:12:45,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:45,814 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] [2025-02-05 17:12:45,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:12:45,815 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:45,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash 56294905, now seen corresponding path program 1 times [2025-02-05 17:12:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782582130] [2025-02-05 17:12:45,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:45,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 17:12:45,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 17:12:45,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:45,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:45,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782582130] [2025-02-05 17:12:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782582130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:45,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:12:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722814553] [2025-02-05 17:12:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:45,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:12:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:45,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:12:45,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:12:45,857 INFO L87 Difference]: Start difference. First operand 3466 states and 5924 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:46,298 INFO L93 Difference]: Finished difference Result 6037 states and 9739 transitions. [2025-02-05 17:12:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:46,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 80 [2025-02-05 17:12:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:46,340 INFO L225 Difference]: With dead ends: 6037 [2025-02-05 17:12:46,340 INFO L226 Difference]: Without dead ends: 4704 [2025-02-05 17:12:46,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:12:46,359 INFO L435 NwaCegarLoop]: 4392 mSDtfsCounter, 4359 mSDsluCounter, 4327 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 8719 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:46,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 8719 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:12:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2025-02-05 17:12:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 4695. [2025-02-05 17:12:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4695 states, 4337 states have (on average 1.6389209130735531) internal successors, (7108), 4389 states have internal predecessors, (7108), 208 states have call successors, (208), 109 states have call predecessors, (208), 148 states have return successors, (327), 204 states have call predecessors, (327), 206 states have call successors, (327) [2025-02-05 17:12:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 7643 transitions. [2025-02-05 17:12:46,675 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 7643 transitions. Word has length 80 [2025-02-05 17:12:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:46,675 INFO L471 AbstractCegarLoop]: Abstraction has 4695 states and 7643 transitions. [2025-02-05 17:12:46,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 7643 transitions. [2025-02-05 17:12:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 17:12:46,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:46,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 17:12:46,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:12:46,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:46,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:46,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1545851375, now seen corresponding path program 1 times [2025-02-05 17:12:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578417504] [2025-02-05 17:12:46,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:46,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 17:12:46,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 17:12:46,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:46,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:12:46,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:46,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578417504] [2025-02-05 17:12:46,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578417504] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:12:46,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083854930] [2025-02-05 17:12:46,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:46,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:46,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:46,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:12:46,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:12:46,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 17:12:46,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 17:12:46,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:46,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:46,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:12:46,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:12:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 17:12:46,971 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:12:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083854930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:46,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:12:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:12:46,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936177044] [2025-02-05 17:12:46,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:46,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:12:46,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:46,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:12:46,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:46,972 INFO L87 Difference]: Start difference. First operand 4695 states and 7643 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:12:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:47,170 INFO L93 Difference]: Finished difference Result 9728 states and 14917 transitions. [2025-02-05 17:12:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:12:47,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2025-02-05 17:12:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:47,188 INFO L225 Difference]: With dead ends: 9728 [2025-02-05 17:12:47,189 INFO L226 Difference]: Without dead ends: 7166 [2025-02-05 17:12:47,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:47,196 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4152 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4152 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:47,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4152 Valid, 4410 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:12:47,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7166 states. [2025-02-05 17:12:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7166 to 7108. [2025-02-05 17:12:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7108 states, 6418 states have (on average 1.5680897475849174) internal successors, (10064), 6519 states have internal predecessors, (10064), 392 states have call successors, (392), 217 states have call predecessors, (392), 296 states have return successors, (625), 379 states have call predecessors, (625), 390 states have call successors, (625) [2025-02-05 17:12:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7108 states to 7108 states and 11081 transitions. [2025-02-05 17:12:47,470 INFO L78 Accepts]: Start accepts. Automaton has 7108 states and 11081 transitions. Word has length 131 [2025-02-05 17:12:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:47,470 INFO L471 AbstractCegarLoop]: Abstraction has 7108 states and 11081 transitions. [2025-02-05 17:12:47,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:12:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 7108 states and 11081 transitions. [2025-02-05 17:12:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 17:12:47,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:47,477 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 17:12:47,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:12:47,680 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-02-05 17:12:47,681 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:47,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1856729717, now seen corresponding path program 1 times [2025-02-05 17:12:47,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:47,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026807736] [2025-02-05 17:12:47,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:47,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:47,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 17:12:47,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 17:12:47,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:47,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:12:47,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:47,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026807736] [2025-02-05 17:12:47,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026807736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:12:47,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599281827] [2025-02-05 17:12:47,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:47,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:47,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:47,738 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-02-05 17:12:47,739 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-02-05 17:12:47,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 17:12:47,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 17:12:47,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:47,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:47,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:12:47,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:12:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 17:12:47,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:12:47,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599281827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:47,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:12:47,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:12:47,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889840538] [2025-02-05 17:12:47,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:47,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:12:47,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:47,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:12:47,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:47,869 INFO L87 Difference]: Start difference. First operand 7108 states and 11081 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:12:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:48,181 INFO L93 Difference]: Finished difference Result 16925 states and 25243 transitions. [2025-02-05 17:12:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:12:48,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2025-02-05 17:12:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:48,217 INFO L225 Difference]: With dead ends: 16925 [2025-02-05 17:12:48,217 INFO L226 Difference]: Without dead ends: 11950 [2025-02-05 17:12:48,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:48,232 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4146 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:48,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 4410 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:12:48,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11950 states. [2025-02-05 17:12:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11950 to 11838. [2025-02-05 17:12:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11838 states, 10486 states have (on average 1.5094411596414266) internal successors, (15828), 10685 states have internal predecessors, (15828), 758 states have call successors, (758), 433 states have call predecessors, (758), 592 states have return successors, (1219), 727 states have call predecessors, (1219), 756 states have call successors, (1219) [2025-02-05 17:12:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11838 states to 11838 states and 17805 transitions. [2025-02-05 17:12:48,893 INFO L78 Accepts]: Start accepts. Automaton has 11838 states and 17805 transitions. Word has length 131 [2025-02-05 17:12:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:48,893 INFO L471 AbstractCegarLoop]: Abstraction has 11838 states and 17805 transitions. [2025-02-05 17:12:48,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:12:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 11838 states and 17805 transitions. [2025-02-05 17:12:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 17:12:48,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:48,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 17:12:48,913 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-02-05 17:12:49,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:49,106 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:49,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1702850427, now seen corresponding path program 1 times [2025-02-05 17:12:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881851862] [2025-02-05 17:12:49,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:49,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 17:12:49,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 17:12:49,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:49,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:12:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881851862] [2025-02-05 17:12:49,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881851862] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:12:49,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581491416] [2025-02-05 17:12:49,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:49,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:49,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:49,194 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-02-05 17:12:49,196 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-02-05 17:12:49,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 17:12:49,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 17:12:49,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:49,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:49,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:12:49,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:12:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 17:12:49,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:12:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581491416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:49,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:12:49,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:12:49,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640220071] [2025-02-05 17:12:49,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:49,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:12:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:49,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:12:49,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:49,337 INFO L87 Difference]: Start difference. First operand 11838 states and 17805 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:12:50,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:50,068 INFO L93 Difference]: Finished difference Result 30983 states and 45357 transitions. [2025-02-05 17:12:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:12:50,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 131 [2025-02-05 17:12:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:50,132 INFO L225 Difference]: With dead ends: 30983 [2025-02-05 17:12:50,132 INFO L226 Difference]: Without dead ends: 21278 [2025-02-05 17:12:50,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:50,162 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4158 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4158 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:50,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4158 Valid, 4410 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:12:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2025-02-05 17:12:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21058. [2025-02-05 17:12:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21058 states, 18402 states have (on average 1.4687533963699597) internal successors, (27028), 18797 states have internal predecessors, (27028), 1470 states have call successors, (1470), 865 states have call predecessors, (1470), 1184 states have return successors, (2387), 1403 states have call predecessors, (2387), 1468 states have call successors, (2387) [2025-02-05 17:12:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21058 states to 21058 states and 30885 transitions. [2025-02-05 17:12:50,937 INFO L78 Accepts]: Start accepts. Automaton has 21058 states and 30885 transitions. Word has length 131 [2025-02-05 17:12:50,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:50,938 INFO L471 AbstractCegarLoop]: Abstraction has 21058 states and 30885 transitions. [2025-02-05 17:12:50,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:12:50,938 INFO L276 IsEmpty]: Start isEmpty. Operand 21058 states and 30885 transitions. [2025-02-05 17:12:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 17:12:50,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:50,955 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 17:12:50,961 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-02-05 17:12:51,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:51,155 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:51,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -867036287, now seen corresponding path program 1 times [2025-02-05 17:12:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559901265] [2025-02-05 17:12:51,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:51,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 17:12:51,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 17:12:51,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:51,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:12:51,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:51,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559901265] [2025-02-05 17:12:51,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559901265] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:12:51,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523894286] [2025-02-05 17:12:51,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:51,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:51,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:51,218 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-02-05 17:12:51,222 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-02-05 17:12:51,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 17:12:51,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 17:12:51,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:51,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:51,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:12:51,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:12:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 17:12:51,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:12:51,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523894286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:51,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:12:51,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:12:51,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631756806] [2025-02-05 17:12:51,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:12:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:51,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:12:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:51,330 INFO L87 Difference]: Start difference. First operand 21058 states and 30885 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:12:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:52,307 INFO L93 Difference]: Finished difference Result 57283 states and 83205 transitions. [2025-02-05 17:12:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:12:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 131 [2025-02-05 17:12:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:52,623 INFO L225 Difference]: With dead ends: 57283 [2025-02-05 17:12:52,623 INFO L226 Difference]: Without dead ends: 38359 [2025-02-05 17:12:52,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:52,660 INFO L435 NwaCegarLoop]: 4398 mSDtfsCounter, 197 mSDsluCounter, 4195 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 8593 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:52,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 8593 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:12:52,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38359 states. [2025-02-05 17:12:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38359 to 38359. [2025-02-05 17:12:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38359 states, 33272 states have (on average 1.4372745852368358) internal successors, (47821), 33988 states have internal predecessors, (47821), 2755 states have call successors, (2755), 1691 states have call predecessors, (2755), 2330 states have return successors, (5010), 2695 states have call predecessors, (5010), 2753 states have call successors, (5010) [2025-02-05 17:12:54,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38359 states to 38359 states and 55586 transitions. [2025-02-05 17:12:54,787 INFO L78 Accepts]: Start accepts. Automaton has 38359 states and 55586 transitions. Word has length 131 [2025-02-05 17:12:54,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:54,788 INFO L471 AbstractCegarLoop]: Abstraction has 38359 states and 55586 transitions. [2025-02-05 17:12:54,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:12:54,789 INFO L276 IsEmpty]: Start isEmpty. Operand 38359 states and 55586 transitions. [2025-02-05 17:12:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 17:12:54,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:54,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 17:12:54,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 17:12:55,076 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,SelfDestructingSolverStorable11 [2025-02-05 17:12:55,077 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:55,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1864688756, now seen corresponding path program 1 times [2025-02-05 17:12:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576552208] [2025-02-05 17:12:55,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:55,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 17:12:55,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 17:12:55,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:55,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 17:12:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576552208] [2025-02-05 17:12:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576552208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:12:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420016779] [2025-02-05 17:12:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:55,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:55,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:55,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:12:55,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:12:55,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 17:12:55,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 17:12:55,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:55,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:55,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:12:55,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:12:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 17:12:55,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:12:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420016779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:55,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:12:55,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:12:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254659993] [2025-02-05 17:12:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:55,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:12:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:55,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:12:55,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:55,387 INFO L87 Difference]: Start difference. First operand 38359 states and 55586 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:12:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:56,368 INFO L93 Difference]: Finished difference Result 63045 states and 91315 transitions. [2025-02-05 17:12:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:12:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 190 [2025-02-05 17:12:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:56,696 INFO L225 Difference]: With dead ends: 63045 [2025-02-05 17:12:56,697 INFO L226 Difference]: Without dead ends: 34183 [2025-02-05 17:12:56,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:56,741 INFO L435 NwaCegarLoop]: 4193 mSDtfsCounter, 4120 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4120 SdHoareTripleChecker+Valid, 4237 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:56,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4120 Valid, 4237 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:12:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34183 states. [2025-02-05 17:12:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34183 to 26267. [2025-02-05 17:12:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26267 states, 23076 states have (on average 1.4144999133298666) internal successors, (32641), 23316 states have internal predecessors, (32641), 1811 states have call successors, (1811), 1187 states have call predecessors, (1811), 1378 states have return successors, (2546), 1771 states have call predecessors, (2546), 1809 states have call successors, (2546) [2025-02-05 17:12:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26267 states to 26267 states and 36998 transitions. [2025-02-05 17:12:58,533 INFO L78 Accepts]: Start accepts. Automaton has 26267 states and 36998 transitions. Word has length 190 [2025-02-05 17:12:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:58,533 INFO L471 AbstractCegarLoop]: Abstraction has 26267 states and 36998 transitions. [2025-02-05 17:12:58,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:12:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 26267 states and 36998 transitions. [2025-02-05 17:12:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 17:12:58,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:58,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 17:12:58,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 17:12:58,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 17:12:58,776 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:58,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -762898773, now seen corresponding path program 1 times [2025-02-05 17:12:58,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:58,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429874166] [2025-02-05 17:12:58,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:58,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:58,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 17:12:58,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 17:12:58,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:58,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 17:12:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:58,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429874166] [2025-02-05 17:12:58,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429874166] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:12:58,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349009435] [2025-02-05 17:12:58,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:58,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:58,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:58,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:12:58,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:12:58,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 17:12:58,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 17:12:58,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:58,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:58,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:12:58,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:12:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 17:12:59,070 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:12:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349009435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:12:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:12:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449692853] [2025-02-05 17:12:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:12:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:59,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:12:59,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:59,072 INFO L87 Difference]: Start difference. First operand 26267 states and 36998 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:13:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:00,387 INFO L93 Difference]: Finished difference Result 53071 states and 74421 transitions. [2025-02-05 17:13:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:13:00,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 190 [2025-02-05 17:13:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:00,478 INFO L225 Difference]: With dead ends: 53071 [2025-02-05 17:13:00,478 INFO L226 Difference]: Without dead ends: 28945 [2025-02-05 17:13:00,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:00,511 INFO L435 NwaCegarLoop]: 4191 mSDtfsCounter, 4137 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4137 SdHoareTripleChecker+Valid, 4234 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:00,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4137 Valid, 4234 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28945 states. [2025-02-05 17:13:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28945 to 28945. [2025-02-05 17:13:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28945 states, 25550 states have (on average 1.3784344422700587) internal successors, (35219), 25790 states have internal predecessors, (35219), 1869 states have call successors, (1869), 1333 states have call predecessors, (1869), 1524 states have return successors, (2618), 1829 states have call predecessors, (2618), 1867 states have call successors, (2618) [2025-02-05 17:13:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28945 states to 28945 states and 39706 transitions. [2025-02-05 17:13:01,498 INFO L78 Accepts]: Start accepts. Automaton has 28945 states and 39706 transitions. Word has length 190 [2025-02-05 17:13:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:01,500 INFO L471 AbstractCegarLoop]: Abstraction has 28945 states and 39706 transitions. [2025-02-05 17:13:01,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:13:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 28945 states and 39706 transitions. [2025-02-05 17:13:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 17:13:01,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:01,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 17:13:01,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 17:13:01,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 17:13:01,732 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:01,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash -963367258, now seen corresponding path program 1 times [2025-02-05 17:13:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:01,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023082183] [2025-02-05 17:13:01,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:01,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 17:13:01,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 17:13:01,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:01,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 17:13:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:01,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023082183] [2025-02-05 17:13:01,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023082183] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:01,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901644724] [2025-02-05 17:13:01,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:01,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:01,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:01,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:01,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 17:13:01,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 17:13:01,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 17:13:01,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:01,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:01,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 17:13:01,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 17:13:01,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901644724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:01,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:13:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796512073] [2025-02-05 17:13:01,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:01,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:01,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:01,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:01,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:01,957 INFO L87 Difference]: Start difference. First operand 28945 states and 39706 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:13:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:03,281 INFO L93 Difference]: Finished difference Result 51834 states and 69950 transitions. [2025-02-05 17:13:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:13:03,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 190 [2025-02-05 17:13:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:03,529 INFO L225 Difference]: With dead ends: 51834 [2025-02-05 17:13:03,529 INFO L226 Difference]: Without dead ends: 31389 [2025-02-05 17:13:03,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:03,601 INFO L435 NwaCegarLoop]: 4252 mSDtfsCounter, 4117 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 4473 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:03,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 4473 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31389 states. [2025-02-05 17:13:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31389 to 31225. [2025-02-05 17:13:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31225 states, 27686 states have (on average 1.353861157263599) internal successors, (37483), 27926 states have internal predecessors, (37483), 1897 states have call successors, (1897), 1449 states have call predecessors, (1897), 1640 states have return successors, (2762), 1857 states have call predecessors, (2762), 1895 states have call successors, (2762) [2025-02-05 17:13:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31225 states to 31225 states and 42142 transitions. [2025-02-05 17:13:04,861 INFO L78 Accepts]: Start accepts. Automaton has 31225 states and 42142 transitions. Word has length 190 [2025-02-05 17:13:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:04,862 INFO L471 AbstractCegarLoop]: Abstraction has 31225 states and 42142 transitions. [2025-02-05 17:13:04,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:13:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31225 states and 42142 transitions. [2025-02-05 17:13:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 17:13:04,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:04,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 17:13:04,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 17:13:05,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:05,099 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:05,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1912021946, now seen corresponding path program 1 times [2025-02-05 17:13:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:05,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469492162] [2025-02-05 17:13:05,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:05,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:05,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 17:13:05,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 17:13:05,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:05,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 17:13:05,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469492162] [2025-02-05 17:13:05,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469492162] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:05,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506750768] [2025-02-05 17:13:05,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:05,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:05,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:05,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:05,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 17:13:05,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 17:13:05,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 17:13:05,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:05,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:05,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:13:05,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 17:13:05,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:05,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506750768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:05,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:05,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:13:05,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404452497] [2025-02-05 17:13:05,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:05,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:05,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:05,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:05,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:05,298 INFO L87 Difference]: Start difference. First operand 31225 states and 42142 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:13:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:07,350 INFO L93 Difference]: Finished difference Result 85729 states and 114984 transitions. [2025-02-05 17:13:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:13:07,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 191 [2025-02-05 17:13:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:07,824 INFO L225 Difference]: With dead ends: 85729 [2025-02-05 17:13:07,824 INFO L226 Difference]: Without dead ends: 56645 [2025-02-05 17:13:07,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:07,867 INFO L435 NwaCegarLoop]: 4399 mSDtfsCounter, 191 mSDsluCounter, 4187 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 8586 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:07,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 8586 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56645 states. [2025-02-05 17:13:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56645 to 56641. [2025-02-05 17:13:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56641 states, 49888 states have (on average 1.3301194676074406) internal successors, (66357), 50366 states have internal predecessors, (66357), 3631 states have call successors, (3631), 2737 states have call predecessors, (3631), 3120 states have return successors, (6322), 3553 states have call predecessors, (6322), 3629 states have call successors, (6322) [2025-02-05 17:13:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56641 states to 56641 states and 76310 transitions. [2025-02-05 17:13:09,982 INFO L78 Accepts]: Start accepts. Automaton has 56641 states and 76310 transitions. Word has length 191 [2025-02-05 17:13:09,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:09,983 INFO L471 AbstractCegarLoop]: Abstraction has 56641 states and 76310 transitions. [2025-02-05 17:13:09,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:13:09,983 INFO L276 IsEmpty]: Start isEmpty. Operand 56641 states and 76310 transitions. [2025-02-05 17:13:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 17:13:10,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:10,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 17:13:10,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 17:13:10,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 17:13:10,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:10,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:10,280 INFO L85 PathProgramCache]: Analyzing trace with hash -466595375, now seen corresponding path program 1 times [2025-02-05 17:13:10,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:10,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194748913] [2025-02-05 17:13:10,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:10,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:10,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 17:13:10,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 17:13:10,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:10,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 17:13:10,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:10,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194748913] [2025-02-05 17:13:10,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194748913] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:10,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833795592] [2025-02-05 17:13:10,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:10,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:10,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:10,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 17:13:10,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 17:13:10,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 17:13:10,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:10,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:10,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:13:10,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 17:13:10,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:10,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833795592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:10,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:10,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:13:10,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090243108] [2025-02-05 17:13:10,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:10,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:10,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:10,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:10,516 INFO L87 Difference]: Start difference. First operand 56641 states and 76310 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)