./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.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_label49+token_ring.04.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cb4eb95fbb86e81adddda10624c3164b4456d4761ce2ac967ea89c58c777ea3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:18:43,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:18:43,304 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:18:43,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:18:43,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:18:43,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:18:43,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:18:43,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:18:43,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:18:43,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:18:43,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:18:43,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:18:43,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:18:43,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:18:43,339 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:18:43,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:18:43,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:18:43,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:18:43,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:18:43,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:18:43,341 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 -> 1cb4eb95fbb86e81adddda10624c3164b4456d4761ce2ac967ea89c58c777ea3 [2025-02-05 17:18:43,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:18:43,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:18:43,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:18:43,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:18:43,571 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:18:43,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-1.c [2025-02-05 17:18:44,712 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b027bf5c3/75ba19e663124bd7a5a9519786c3e8a0/FLAG65f2e8c65 [2025-02-05 17:18:45,329 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:18:45,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.04.cil-1.c [2025-02-05 17:18:45,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b027bf5c3/75ba19e663124bd7a5a9519786c3e8a0/FLAG65f2e8c65 [2025-02-05 17:18:45,772 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b027bf5c3/75ba19e663124bd7a5a9519786c3e8a0 [2025-02-05 17:18:45,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:18:45,775 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:18:45,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:18:45,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:18:45,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:18:45,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:18:45" (1/1) ... [2025-02-05 17:18:45,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d6a7008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:45, skipping insertion in model container [2025-02-05 17:18:45,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:18:45" (1/1) ... [2025-02-05 17:18:45,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:18:46,953 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_label49+token_ring.04.cil-1.c[380593,380606] [2025-02-05 17:18:46,979 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_label49+token_ring.04.cil-1.c[383339,383352] [2025-02-05 17:18:47,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:18:47,137 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:18:47,625 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_label49+token_ring.04.cil-1.c[380593,380606] [2025-02-05 17:18:47,629 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_label49+token_ring.04.cil-1.c[383339,383352] [2025-02-05 17:18:47,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:18:47,684 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:18:47,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47 WrapperNode [2025-02-05 17:18:47,685 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:18:47,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:18:47,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:18:47,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:18:47,690 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:18:47" (1/1) ... [2025-02-05 17:18:47,750 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:18:47" (1/1) ... [2025-02-05 17:18:48,017 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12729 [2025-02-05 17:18:48,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:18:48,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:18:48,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:18:48,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:18:48,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,278 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:18:48,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:18:48,517 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:18:48,517 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:18:48,517 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:18:48,518 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (1/1) ... [2025-02-05 17:18:48,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:18:48,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:18:48,541 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:18:48,548 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:18:48,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:18:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:18:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:18:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:18:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:18:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:18:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:18:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:18:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:18:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:18:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:18:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:18:48,562 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:18:48,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:18:48,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:18:48,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:18:48,639 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:18:48,641 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:18:54,450 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:18:54,450 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:18:54,450 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:18:54,451 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:18:54,451 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:18:54,451 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:18:54,452 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:18:54,629 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2025-02-05 17:18:54,630 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:18:54,681 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:18:54,681 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:18:54,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:18:54 BoogieIcfgContainer [2025-02-05 17:18:54,682 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:18:54,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:18:54,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:18:54,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:18:54,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:18:45" (1/3) ... [2025-02-05 17:18:54,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aaf1a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:18:54, skipping insertion in model container [2025-02-05 17:18:54,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:18:47" (2/3) ... [2025-02-05 17:18:54,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aaf1a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:18:54, skipping insertion in model container [2025-02-05 17:18:54,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:18:54" (3/3) ... [2025-02-05 17:18:54,690 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.04.cil-1.c [2025-02-05 17:18:54,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:18:54,705 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.04.cil-1.c that has 7 procedures, 2375 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-02-05 17:18:54,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:18:54,800 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;@30ea572c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:18:54,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:18:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 2375 states, 2348 states have (on average 1.8471039182282794) internal successors, (4337), 2351 states have internal predecessors, (4337), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 17:18:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:18:54,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:54,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:54,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:54,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:54,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2045429622, now seen corresponding path program 1 times [2025-02-05 17:18:54,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:54,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504448317] [2025-02-05 17:18:54,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:54,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:54,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:18:54,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:18:54,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:54,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:55,208 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:18:55,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:55,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504448317] [2025-02-05 17:18:55,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504448317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:55,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:55,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:55,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969333923] [2025-02-05 17:18:55,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:55,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:55,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:55,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:55,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:55,237 INFO L87 Difference]: Start difference. First operand has 2375 states, 2348 states have (on average 1.8471039182282794) internal successors, (4337), 2351 states have internal predecessors, (4337), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:55,724 INFO L93 Difference]: Finished difference Result 4932 states and 9029 transitions. [2025-02-05 17:18:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:18:55,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:18:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:55,752 INFO L225 Difference]: With dead ends: 4932 [2025-02-05 17:18:55,752 INFO L226 Difference]: Without dead ends: 2499 [2025-02-05 17:18:55,759 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:18:55,761 INFO L435 NwaCegarLoop]: 4244 mSDtfsCounter, 4506 mSDsluCounter, 8599 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4518 SdHoareTripleChecker+Valid, 12843 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:55,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4518 Valid, 12843 Invalid, 344 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2025-02-05 17:18:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2486. [2025-02-05 17:18:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2440 states have (on average 1.8184426229508197) internal successors, (4437), 2443 states have internal predecessors, (4437), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 17:18:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4500 transitions. [2025-02-05 17:18:55,917 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4500 transitions. Word has length 90 [2025-02-05 17:18:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:55,918 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4500 transitions. [2025-02-05 17:18:55,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4500 transitions. [2025-02-05 17:18:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:18:55,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:55,924 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:55,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:18:55,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:55,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:55,926 INFO L85 PathProgramCache]: Analyzing trace with hash -689383752, now seen corresponding path program 1 times [2025-02-05 17:18:55,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:55,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531473593] [2025-02-05 17:18:55,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:55,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:55,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:18:55,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:18:55,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:55,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:56,157 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:18:56,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:56,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531473593] [2025-02-05 17:18:56,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531473593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:56,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:56,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:56,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49718940] [2025-02-05 17:18:56,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:56,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:56,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:56,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:56,161 INFO L87 Difference]: Start difference. First operand 2486 states and 4500 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:56,402 INFO L93 Difference]: Finished difference Result 2869 states and 5081 transitions. [2025-02-05 17:18:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:18:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:56,413 INFO L225 Difference]: With dead ends: 2869 [2025-02-05 17:18:56,414 INFO L226 Difference]: Without dead ends: 2516 [2025-02-05 17:18:56,416 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:18:56,416 INFO L435 NwaCegarLoop]: 4163 mSDtfsCounter, 4309 mSDsluCounter, 8251 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 12414 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:56,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 12414 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2025-02-05 17:18:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2486. [2025-02-05 17:18:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2440 states have (on average 1.8176229508196722) internal successors, (4435), 2443 states have internal predecessors, (4435), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 17:18:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4498 transitions. [2025-02-05 17:18:56,488 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4498 transitions. Word has length 90 [2025-02-05 17:18:56,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:56,489 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4498 transitions. [2025-02-05 17:18:56,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4498 transitions. [2025-02-05 17:18:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:18:56,490 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:56,490 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:56,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:18:56,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash -245772329, now seen corresponding path program 1 times [2025-02-05 17:18:56,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:56,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627594225] [2025-02-05 17:18:56,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:56,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:18:56,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:18:56,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:56,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:56,640 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:18:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:56,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627594225] [2025-02-05 17:18:56,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627594225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:56,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:56,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:56,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332618717] [2025-02-05 17:18:56,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:56,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:56,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:56,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:56,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:56,642 INFO L87 Difference]: Start difference. First operand 2486 states and 4498 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:57,066 INFO L93 Difference]: Finished difference Result 3054 states and 5348 transitions. [2025-02-05 17:18:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:57,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:18:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:57,078 INFO L225 Difference]: With dead ends: 3054 [2025-02-05 17:18:57,078 INFO L226 Difference]: Without dead ends: 2701 [2025-02-05 17:18:57,081 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:18:57,081 INFO L435 NwaCegarLoop]: 4312 mSDtfsCounter, 4425 mSDsluCounter, 12931 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 17243 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:57,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 17243 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-02-05 17:18:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2652. [2025-02-05 17:18:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2586 states have (on average 1.797370456303171) internal successors, (4648), 2590 states have internal predecessors, (4648), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-02-05 17:18:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 4740 transitions. [2025-02-05 17:18:57,153 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 4740 transitions. Word has length 90 [2025-02-05 17:18:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:57,154 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 4740 transitions. [2025-02-05 17:18:57,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 4740 transitions. [2025-02-05 17:18:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:18:57,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:57,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:57,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:18:57,157 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1201293608, now seen corresponding path program 1 times [2025-02-05 17:18:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:57,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127074762] [2025-02-05 17:18:57,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:57,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:57,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:18:57,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:18:57,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:57,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:57,313 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:18:57,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:57,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127074762] [2025-02-05 17:18:57,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127074762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:57,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:57,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:57,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595412073] [2025-02-05 17:18:57,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:57,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:57,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:57,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:57,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:57,315 INFO L87 Difference]: Start difference. First operand 2652 states and 4740 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:57,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:57,719 INFO L93 Difference]: Finished difference Result 3571 states and 6111 transitions. [2025-02-05 17:18:57,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:57,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:18:57,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:57,735 INFO L225 Difference]: With dead ends: 3571 [2025-02-05 17:18:57,735 INFO L226 Difference]: Without dead ends: 3052 [2025-02-05 17:18:57,738 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:18:57,739 INFO L435 NwaCegarLoop]: 4308 mSDtfsCounter, 4420 mSDsluCounter, 12919 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4432 SdHoareTripleChecker+Valid, 17227 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:57,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4432 Valid, 17227 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2025-02-05 17:18:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2999. [2025-02-05 17:18:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2891 states have (on average 1.763057765479073) internal successors, (5097), 2899 states have internal predecessors, (5097), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-02-05 17:18:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5253 transitions. [2025-02-05 17:18:57,831 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5253 transitions. Word has length 90 [2025-02-05 17:18:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:57,831 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 5253 transitions. [2025-02-05 17:18:57,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5253 transitions. [2025-02-05 17:18:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:18:57,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:57,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:57,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:18:57,835 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:57,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:57,835 INFO L85 PathProgramCache]: Analyzing trace with hash 984640439, now seen corresponding path program 1 times [2025-02-05 17:18:57,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:57,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482717931] [2025-02-05 17:18:57,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:57,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:18:57,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:18:57,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:57,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:57,950 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:18:57,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:57,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482717931] [2025-02-05 17:18:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482717931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:57,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:57,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859752347] [2025-02-05 17:18:57,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:57,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:57,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:57,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:57,954 INFO L87 Difference]: Start difference. First operand 2999 states and 5253 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:58,488 INFO L93 Difference]: Finished difference Result 4660 states and 7750 transitions. [2025-02-05 17:18:58,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:58,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:18:58,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:58,504 INFO L225 Difference]: With dead ends: 4660 [2025-02-05 17:18:58,505 INFO L226 Difference]: Without dead ends: 3794 [2025-02-05 17:18:58,509 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:18:58,510 INFO L435 NwaCegarLoop]: 4305 mSDtfsCounter, 4415 mSDsluCounter, 12910 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4427 SdHoareTripleChecker+Valid, 17215 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:58,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4427 Valid, 17215 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2025-02-05 17:18:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3732. [2025-02-05 17:18:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3732 states, 3534 states have (on average 1.712790039615167) internal successors, (6053), 3556 states have internal predecessors, (6053), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-02-05 17:18:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 6361 transitions. [2025-02-05 17:18:58,648 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 6361 transitions. Word has length 90 [2025-02-05 17:18:58,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:58,648 INFO L471 AbstractCegarLoop]: Abstraction has 3732 states and 6361 transitions. [2025-02-05 17:18:58,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 6361 transitions. [2025-02-05 17:18:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:18:58,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:58,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:58,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:18:58,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:58,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash 500965112, now seen corresponding path program 1 times [2025-02-05 17:18:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319326971] [2025-02-05 17:18:58,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:58,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:18:58,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:18:58,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:58,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:58,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:58,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319326971] [2025-02-05 17:18:58,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319326971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:58,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:58,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532150632] [2025-02-05 17:18:58,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:58,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:58,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:58,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:58,754 INFO L87 Difference]: Start difference. First operand 3732 states and 6361 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:59,262 INFO L93 Difference]: Finished difference Result 7239 states and 11737 transitions. [2025-02-05 17:18:59,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:59,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:18:59,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:59,283 INFO L225 Difference]: With dead ends: 7239 [2025-02-05 17:18:59,283 INFO L226 Difference]: Without dead ends: 5640 [2025-02-05 17:18:59,289 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:18:59,290 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 4544 mSDsluCounter, 12890 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 17190 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:59,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 17190 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:18:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5640 states. [2025-02-05 17:18:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5640 to 5273. [2025-02-05 17:18:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4885 states have (on average 1.655885363357216) internal successors, (8089), 4953 states have internal predecessors, (8089), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 17:18:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 8781 transitions. [2025-02-05 17:18:59,428 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 8781 transitions. Word has length 90 [2025-02-05 17:18:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:59,428 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 8781 transitions. [2025-02-05 17:18:59,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 8781 transitions. [2025-02-05 17:18:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:18:59,431 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:59,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:59,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:18:59,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:59,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1455194007, now seen corresponding path program 1 times [2025-02-05 17:18:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463153673] [2025-02-05 17:18:59,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:59,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:18:59,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:18:59,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:59,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:59,510 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:18:59,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:59,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463153673] [2025-02-05 17:18:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463153673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:59,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:59,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417739104] [2025-02-05 17:18:59,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:59,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:59,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:59,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:59,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:59,511 INFO L87 Difference]: Start difference. First operand 5273 states and 8781 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:18:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:59,841 INFO L93 Difference]: Finished difference Result 8828 states and 14458 transitions. [2025-02-05 17:18:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:59,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:18:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:59,863 INFO L225 Difference]: With dead ends: 8828 [2025-02-05 17:18:59,864 INFO L226 Difference]: Without dead ends: 5688 [2025-02-05 17:18:59,870 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:18:59,871 INFO L435 NwaCegarLoop]: 4143 mSDtfsCounter, 4307 mSDsluCounter, 8219 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4319 SdHoareTripleChecker+Valid, 12362 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:59,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4319 Valid, 12362 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:18:59,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2025-02-05 17:19:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 5273. [2025-02-05 17:19:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4885 states have (on average 1.652405322415558) internal successors, (8072), 4953 states have internal predecessors, (8072), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 17:19:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 8764 transitions. [2025-02-05 17:19:00,050 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 8764 transitions. Word has length 90 [2025-02-05 17:19:00,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:00,051 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 8764 transitions. [2025-02-05 17:19:00,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 8764 transitions. [2025-02-05 17:19:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:19:00,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:00,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:00,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:19:00,055 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:00,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:00,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1208880920, now seen corresponding path program 1 times [2025-02-05 17:19:00,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:00,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967079239] [2025-02-05 17:19:00,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:00,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:19:00,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:19:00,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:00,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:00,147 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:19:00,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:00,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967079239] [2025-02-05 17:19:00,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967079239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:00,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:00,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:19:00,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123907864] [2025-02-05 17:19:00,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:00,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:19:00,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:00,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:19:00,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:00,150 INFO L87 Difference]: Start difference. First operand 5273 states and 8764 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:00,685 INFO L93 Difference]: Finished difference Result 12074 states and 19568 transitions. [2025-02-05 17:19:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:19:00,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:19:00,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:00,721 INFO L225 Difference]: With dead ends: 12074 [2025-02-05 17:19:00,721 INFO L226 Difference]: Without dead ends: 8934 [2025-02-05 17:19:00,734 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:19:00,737 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 4471 mSDsluCounter, 12867 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4488 SdHoareTripleChecker+Valid, 17159 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:00,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4488 Valid, 17159 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:19:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2025-02-05 17:19:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 8493. [2025-02-05 17:19:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5973434040890742) internal successors, (12266), 7893 states have internal predecessors, (12266), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:19:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14094 transitions. [2025-02-05 17:19:01,131 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14094 transitions. Word has length 90 [2025-02-05 17:19:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:01,131 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14094 transitions. [2025-02-05 17:19:01,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14094 transitions. [2025-02-05 17:19:01,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:19:01,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:01,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:01,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:19:01,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:01,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash -461632649, now seen corresponding path program 1 times [2025-02-05 17:19:01,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:01,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465193740] [2025-02-05 17:19:01,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:01,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:01,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:19:01,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:19:01,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:01,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:01,206 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:19:01,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465193740] [2025-02-05 17:19:01,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465193740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:01,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460495892] [2025-02-05 17:19:01,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:01,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:01,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:01,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:01,208 INFO L87 Difference]: Start difference. First operand 8493 states and 14094 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:01,585 INFO L93 Difference]: Finished difference Result 15588 states and 26038 transitions. [2025-02-05 17:19:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:01,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:19:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:01,617 INFO L225 Difference]: With dead ends: 15588 [2025-02-05 17:19:01,617 INFO L226 Difference]: Without dead ends: 9228 [2025-02-05 17:19:01,636 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:19:01,637 INFO L435 NwaCegarLoop]: 4147 mSDtfsCounter, 4296 mSDsluCounter, 8219 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4308 SdHoareTripleChecker+Valid, 12366 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:01,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4308 Valid, 12366 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:19:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2025-02-05 17:19:01,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 8493. [2025-02-05 17:19:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5930459695272823) internal successors, (12233), 7893 states have internal predecessors, (12233), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:19:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14061 transitions. [2025-02-05 17:19:01,999 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14061 transitions. Word has length 90 [2025-02-05 17:19:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:02,000 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14061 transitions. [2025-02-05 17:19:02,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14061 transitions. [2025-02-05 17:19:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:19:02,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:02,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:02,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:19:02,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:02,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:02,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1069709512, now seen corresponding path program 1 times [2025-02-05 17:19:02,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:02,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717493402] [2025-02-05 17:19:02,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:02,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:02,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:19:02,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:19:02,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:02,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:02,060 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:19:02,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:02,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717493402] [2025-02-05 17:19:02,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717493402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:02,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:02,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:19:02,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196900751] [2025-02-05 17:19:02,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:02,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:19:02,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:02,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:19:02,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:19:02,061 INFO L87 Difference]: Start difference. First operand 8493 states and 14061 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:02,544 INFO L93 Difference]: Finished difference Result 15343 states and 25482 transitions. [2025-02-05 17:19:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:02,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:19:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:02,578 INFO L225 Difference]: With dead ends: 15343 [2025-02-05 17:19:02,578 INFO L226 Difference]: Without dead ends: 8983 [2025-02-05 17:19:02,595 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:19:02,596 INFO L435 NwaCegarLoop]: 4144 mSDtfsCounter, 4293 mSDsluCounter, 8214 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4305 SdHoareTripleChecker+Valid, 12358 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:02,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4305 Valid, 12358 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:19:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8983 states. [2025-02-05 17:19:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8983 to 8493. [2025-02-05 17:19:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5887485349654904) internal successors, (12200), 7893 states have internal predecessors, (12200), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:19:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14028 transitions. [2025-02-05 17:19:03,112 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14028 transitions. Word has length 90 [2025-02-05 17:19:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:03,112 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14028 transitions. [2025-02-05 17:19:03,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14028 transitions. [2025-02-05 17:19:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:19:03,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:03,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:19:03,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:19:03,118 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:03,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 711790423, now seen corresponding path program 1 times [2025-02-05 17:19:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:03,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919057799] [2025-02-05 17:19:03,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:03,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:19:03,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:19:03,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:03,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:03,176 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:19:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919057799] [2025-02-05 17:19:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919057799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:03,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:19:03,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:19:03,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791860828] [2025-02-05 17:19:03,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:03,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:19:03,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:03,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:19:03,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:19:03,178 INFO L87 Difference]: Start difference. First operand 8493 states and 14028 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:03,750 INFO L93 Difference]: Finished difference Result 21043 states and 34229 transitions. [2025-02-05 17:19:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:19:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:19:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:03,796 INFO L225 Difference]: With dead ends: 21043 [2025-02-05 17:19:03,797 INFO L226 Difference]: Without dead ends: 14684 [2025-02-05 17:19:03,815 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:19:03,817 INFO L435 NwaCegarLoop]: 4462 mSDtfsCounter, 4422 mSDsluCounter, 4395 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 8857 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:19:03,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 8857 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:19:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14684 states. [2025-02-05 17:19:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14684 to 14651. [2025-02-05 17:19:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14651 states, 13029 states have (on average 1.532274157648323) internal successors, (19964), 13488 states have internal predecessors, (19964), 800 states have call successors, (800), 396 states have call predecessors, (800), 820 states have return successors, (2817), 798 states have call predecessors, (2817), 800 states have call successors, (2817) [2025-02-05 17:19:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14651 states to 14651 states and 23581 transitions. [2025-02-05 17:19:04,349 INFO L78 Accepts]: Start accepts. Automaton has 14651 states and 23581 transitions. Word has length 90 [2025-02-05 17:19:04,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:04,349 INFO L471 AbstractCegarLoop]: Abstraction has 14651 states and 23581 transitions. [2025-02-05 17:19:04,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:19:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 14651 states and 23581 transitions. [2025-02-05 17:19:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 17:19:04,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:04,374 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, 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:19:04,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:19:04,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:04,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:04,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1908313067, now seen corresponding path program 1 times [2025-02-05 17:19:04,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:04,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599607291] [2025-02-05 17:19:04,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:04,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:04,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:04,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:04,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:04,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:19:04,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:04,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599607291] [2025-02-05 17:19:04,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599607291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:19:04,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295068962] [2025-02-05 17:19:04,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:04,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:04,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:04,442 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:19:04,443 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:19:04,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:04,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:04,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:04,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:04,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:19:04,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:19:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 17:19:04,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:19:04,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295068962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:04,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:19:04,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:19:04,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908610296] [2025-02-05 17:19:04,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:04,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:19:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:04,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:19:04,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:04,617 INFO L87 Difference]: Start difference. First operand 14651 states and 23581 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:05,398 INFO L93 Difference]: Finished difference Result 39354 states and 62625 transitions. [2025-02-05 17:19:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:19:05,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-02-05 17:19:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:05,485 INFO L225 Difference]: With dead ends: 39354 [2025-02-05 17:19:05,486 INFO L226 Difference]: Without dead ends: 26837 [2025-02-05 17:19:05,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:19:05,510 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4179 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4179 SdHoareTripleChecker+Valid, 4468 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:19:05,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4179 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:19:05,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26837 states. [2025-02-05 17:19:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26837 to 26637. [2025-02-05 17:19:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26637 states, 23465 states have (on average 1.5041125079906243) internal successors, (35294), 24381 states have internal predecessors, (35294), 1530 states have call successors, (1530), 792 states have call predecessors, (1530), 1640 states have return successors, (5533), 1495 states have call predecessors, (5533), 1530 states have call successors, (5533) [2025-02-05 17:19:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26637 states to 26637 states and 42357 transitions. [2025-02-05 17:19:06,848 INFO L78 Accepts]: Start accepts. Automaton has 26637 states and 42357 transitions. Word has length 148 [2025-02-05 17:19:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:06,849 INFO L471 AbstractCegarLoop]: Abstraction has 26637 states and 42357 transitions. [2025-02-05 17:19:06,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26637 states and 42357 transitions. [2025-02-05 17:19:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 17:19:06,894 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:06,895 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, 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:19:06,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:19:07,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 17:19:07,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:07,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash -905321189, now seen corresponding path program 1 times [2025-02-05 17:19:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705315560] [2025-02-05 17:19:07,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:07,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:07,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:07,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:07,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:19:07,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:07,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705315560] [2025-02-05 17:19:07,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705315560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:19:07,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371190352] [2025-02-05 17:19:07,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:07,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:07,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:07,186 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:19:07,191 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:19:07,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:07,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:07,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:07,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:07,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:19:07,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:19:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 17:19:07,392 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:19:07,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371190352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:07,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:19:07,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:19:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171358836] [2025-02-05 17:19:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:07,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:19:07,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:07,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:19:07,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:07,393 INFO L87 Difference]: Start difference. First operand 26637 states and 42357 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:09,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:09,047 INFO L93 Difference]: Finished difference Result 74982 states and 118759 transitions. [2025-02-05 17:19:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:19:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-02-05 17:19:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:09,249 INFO L225 Difference]: With dead ends: 74982 [2025-02-05 17:19:09,249 INFO L226 Difference]: Without dead ends: 50479 [2025-02-05 17:19:09,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:19:09,314 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4173 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4173 SdHoareTripleChecker+Valid, 4468 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:19:09,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4173 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:19:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50479 states. [2025-02-05 17:19:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50479 to 50081. [2025-02-05 17:19:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50081 states, 43875 states have (on average 1.488182336182336) internal successors, (65294), 45705 states have internal predecessors, (65294), 2924 states have call successors, (2924), 1584 states have call predecessors, (2924), 3280 states have return successors, (10899), 2823 states have call predecessors, (10899), 2924 states have call successors, (10899) [2025-02-05 17:19:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50081 states to 50081 states and 79117 transitions. [2025-02-05 17:19:11,728 INFO L78 Accepts]: Start accepts. Automaton has 50081 states and 79117 transitions. Word has length 148 [2025-02-05 17:19:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:11,729 INFO L471 AbstractCegarLoop]: Abstraction has 50081 states and 79117 transitions. [2025-02-05 17:19:11,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50081 states and 79117 transitions. [2025-02-05 17:19:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 17:19:11,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:11,783 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, 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:19:11,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 17:19:11,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:11,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:11,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:11,988 INFO L85 PathProgramCache]: Analyzing trace with hash -584772959, now seen corresponding path program 1 times [2025-02-05 17:19:11,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:11,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901545560] [2025-02-05 17:19:11,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:11,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:12,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:12,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:12,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:19:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901545560] [2025-02-05 17:19:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901545560] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:19:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640615456] [2025-02-05 17:19:12,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:12,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:12,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:12,072 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:19:12,074 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:19:12,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:12,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:12,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:12,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:12,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:19:12,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:19:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 17:19:12,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:19:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640615456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:12,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:19:12,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:19:12,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533489128] [2025-02-05 17:19:12,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:12,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:19:12,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:12,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:19:12,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:12,240 INFO L87 Difference]: Start difference. First operand 50081 states and 79117 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:16,622 INFO L93 Difference]: Finished difference Result 145038 states and 229225 transitions. [2025-02-05 17:19:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:19:16,622 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-02-05 17:19:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:17,051 INFO L225 Difference]: With dead ends: 145038 [2025-02-05 17:19:17,051 INFO L226 Difference]: Without dead ends: 97091 [2025-02-05 17:19:17,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:19:17,169 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4185 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4185 SdHoareTripleChecker+Valid, 4468 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:19:17,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4185 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:19:17,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97091 states. [2025-02-05 17:19:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97091 to 96297. [2025-02-05 17:19:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96297 states, 84027 states have (on average 1.4784533542789817) internal successors, (124230), 87685 states have internal predecessors, (124230), 5708 states have call successors, (5708), 3168 states have call predecessors, (5708), 6560 states have return successors, (21627), 5475 states have call predecessors, (21627), 5708 states have call successors, (21627) [2025-02-05 17:19:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96297 states to 96297 states and 151565 transitions. [2025-02-05 17:19:22,002 INFO L78 Accepts]: Start accepts. Automaton has 96297 states and 151565 transitions. Word has length 148 [2025-02-05 17:19:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:22,002 INFO L471 AbstractCegarLoop]: Abstraction has 96297 states and 151565 transitions. [2025-02-05 17:19:22,002 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, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 96297 states and 151565 transitions. [2025-02-05 17:19:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 17:19:22,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:22,094 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, 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:19:22,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 17:19:22,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:22,296 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:22,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:22,296 INFO L85 PathProgramCache]: Analyzing trace with hash 8005415, now seen corresponding path program 1 times [2025-02-05 17:19:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:22,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854946038] [2025-02-05 17:19:22,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:22,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:22,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:22,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:22,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:22,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:19:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:22,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854946038] [2025-02-05 17:19:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854946038] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:19:22,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629209680] [2025-02-05 17:19:22,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:22,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:22,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:22,382 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:19:22,386 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:19:22,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:22,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:22,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:22,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:22,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:19:22,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:19:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 17:19:22,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:19:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629209680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:22,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:19:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:19:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660011983] [2025-02-05 17:19:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:22,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:19:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:22,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:19:22,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:22,600 INFO L87 Difference]: Start difference. First operand 96297 states and 151565 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:19:29,503 INFO L93 Difference]: Finished difference Result 282750 states and 446297 transitions. [2025-02-05 17:19:29,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:19:29,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-02-05 17:19:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:19:30,691 INFO L225 Difference]: With dead ends: 282750 [2025-02-05 17:19:30,692 INFO L226 Difference]: Without dead ends: 188587 [2025-02-05 17:19:30,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 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:19:30,861 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4167 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4167 SdHoareTripleChecker+Valid, 4468 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:19:30,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4167 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:19:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188587 states. [2025-02-05 17:19:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188587 to 187001. [2025-02-05 17:19:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187001 states, 162739 states have (on average 1.4730212180239524) internal successors, (239718), 170053 states have internal predecessors, (239718), 11140 states have call successors, (11140), 6336 states have call predecessors, (11140), 13120 states have return successors, (42947), 10643 states have call predecessors, (42947), 11140 states have call successors, (42947) [2025-02-05 17:19:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187001 states to 187001 states and 293805 transitions. [2025-02-05 17:19:40,847 INFO L78 Accepts]: Start accepts. Automaton has 187001 states and 293805 transitions. Word has length 148 [2025-02-05 17:19:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:19:40,848 INFO L471 AbstractCegarLoop]: Abstraction has 187001 states and 293805 transitions. [2025-02-05 17:19:40,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:19:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 187001 states and 293805 transitions. [2025-02-05 17:19:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 17:19:40,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:19:40,984 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, 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:19:40,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 17:19:41,185 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,SelfDestructingSolverStorable14 [2025-02-05 17:19:41,185 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:19:41,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:19:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1664126675, now seen corresponding path program 1 times [2025-02-05 17:19:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:19:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752327954] [2025-02-05 17:19:41,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:19:41,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:41,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:41,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:41,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:19:41,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:19:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752327954] [2025-02-05 17:19:41,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752327954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:19:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557912342] [2025-02-05 17:19:41,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:19:41,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:19:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:19:41,260 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:19:41,261 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:19:41,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:19:41,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:19:41,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:19:41,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:19:41,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:19:41,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:19:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 17:19:41,368 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:19:41,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557912342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:19:41,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:19:41,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:19:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132222836] [2025-02-05 17:19:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:19:41,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:19:41,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:19:41,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:19:41,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:19:41,369 INFO L87 Difference]: Start difference. First operand 187001 states and 293805 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)