./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.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_label43+token_ring.04.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:09:25,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:09:25,487 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:09:25,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:09:25,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:09:25,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:09:25,525 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:09:25,525 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:09:25,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:09:25,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:09:25,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:09:25,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:09:25,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:09:25,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:09:25,526 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:09:25,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:09:25,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:09:25,526 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:09:25,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:09:25,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:09:25,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:09:25,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:09:25,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:09:25,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:09:25,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:09:25,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:09:25,530 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:09:25,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:09:25,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:09:25,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:09:25,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:09:25,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:09:25,531 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 -> 2c5568751dd37ae3ac79e02a0fd7273b3ab2af9e94f13bec2f84e6a22bfe26f6 [2025-02-05 17:09:25,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:09:25,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:09:25,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:09:25,752 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:09:25,753 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:09:25,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c [2025-02-05 17:09:26,932 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7b22cdbc/7b47d3c9bb304717afd5774a089af173/FLAG363c43ee8 [2025-02-05 17:09:27,511 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:09:27,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.04.cil-2.c [2025-02-05 17:09:27,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7b22cdbc/7b47d3c9bb304717afd5774a089af173/FLAG363c43ee8 [2025-02-05 17:09:28,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7b22cdbc/7b47d3c9bb304717afd5774a089af173 [2025-02-05 17:09:28,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:09:28,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:09:28,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:28,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:09:28,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:09:28,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:28" (1/1) ... [2025-02-05 17:09:28,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ce1670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:28, skipping insertion in model container [2025-02-05 17:09:28,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:09:28" (1/1) ... [2025-02-05 17:09:28,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:09:29,289 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_label43+token_ring.04.cil-2.c[381679,381692] [2025-02-05 17:09:29,317 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_label43+token_ring.04.cil-2.c[383339,383352] [2025-02-05 17:09:29,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:29,524 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:09:30,112 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_label43+token_ring.04.cil-2.c[381679,381692] [2025-02-05 17:09:30,117 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_label43+token_ring.04.cil-2.c[383339,383352] [2025-02-05 17:09:30,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:09:30,176 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:09:30,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30 WrapperNode [2025-02-05 17:09:30,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:09:30,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:30,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:09:30,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:09:30,184 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:09:30" (1/1) ... [2025-02-05 17:09:30,305 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:09:30" (1/1) ... [2025-02-05 17:09:30,602 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 12735 [2025-02-05 17:09:30,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:09:30,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:09:30,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:09:30,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:09:30,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:30,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:30,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:30,810 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:09:30,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:30,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:31,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:31,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:31,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:31,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:31,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:09:31,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:09:31,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:09:31,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:09:31,180 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (1/1) ... [2025-02-05 17:09:31,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:09:31,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:09:31,210 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:09:31,219 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:09:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:09:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:09:31,235 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:09:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:09:31,235 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:09:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:09:31,235 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:09:31,235 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-02-05 17:09:31,235 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-02-05 17:09:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:09:31,236 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:09:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:09:31,236 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:09:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:09:31,236 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:09:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:09:31,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:09:31,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:09:31,324 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:09:31,325 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:09:37,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:09:37,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:09:37,782 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:09:37,782 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:09:37,782 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:09:37,782 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:09:37,783 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:09:37,949 INFO L? ?]: Removed 1711 outVars from TransFormulas that were not future-live. [2025-02-05 17:09:37,949 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:09:38,003 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:09:38,005 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:09:38,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:09:38 BoogieIcfgContainer [2025-02-05 17:09:38,006 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:09:38,008 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:09:38,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:09:38,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:09:38,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:09:28" (1/3) ... [2025-02-05 17:09:38,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208a77fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:09:38, skipping insertion in model container [2025-02-05 17:09:38,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:09:30" (2/3) ... [2025-02-05 17:09:38,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208a77fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:09:38, skipping insertion in model container [2025-02-05 17:09:38,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:09:38" (3/3) ... [2025-02-05 17:09:38,094 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.04.cil-2.c [2025-02-05 17:09:38,103 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:09:38,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.04.cil-2.c that has 8 procedures, 2383 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-02-05 17:09:38,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:09:38,183 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;@4144962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:09:38,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:09:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 2383 states, 2353 states have (on average 1.8474288142796431) internal successors, (4347), 2358 states have internal predecessors, (4347), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 17:09:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:38,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:38,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:38,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:38,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1522854527, now seen corresponding path program 1 times [2025-02-05 17:09:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447746700] [2025-02-05 17:09:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:38,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:38,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:38,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:38,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:38,566 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:09:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447746700] [2025-02-05 17:09:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447746700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:38,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:38,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:38,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779767008] [2025-02-05 17:09:38,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:38,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:38,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:38,600 INFO L87 Difference]: Start difference. First operand has 2383 states, 2353 states have (on average 1.8474288142796431) internal successors, (4347), 2358 states have internal predecessors, (4347), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:39,113 INFO L93 Difference]: Finished difference Result 4954 states and 9071 transitions. [2025-02-05 17:09:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:09:39,115 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:39,143 INFO L225 Difference]: With dead ends: 4954 [2025-02-05 17:09:39,143 INFO L226 Difference]: Without dead ends: 2513 [2025-02-05 17:09:39,152 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:09:39,156 INFO L435 NwaCegarLoop]: 4255 mSDtfsCounter, 4520 mSDsluCounter, 8628 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4532 SdHoareTripleChecker+Valid, 12883 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:39,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4532 Valid, 12883 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:09:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-05 17:09:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2498. [2025-02-05 17:09:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2450 states have (on average 1.8191836734693878) internal successors, (4457), 2454 states have internal predecessors, (4457), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 17:09:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 4522 transitions. [2025-02-05 17:09:39,278 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 4522 transitions. Word has length 91 [2025-02-05 17:09:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:39,279 INFO L471 AbstractCegarLoop]: Abstraction has 2498 states and 4522 transitions. [2025-02-05 17:09:39,279 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 4522 transitions. [2025-02-05 17:09:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:39,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:39,283 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:39,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:09:39,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1651981443, now seen corresponding path program 1 times [2025-02-05 17:09:39,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677477480] [2025-02-05 17:09:39,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:39,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:39,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:39,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:39,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:39,476 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:09:39,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677477480] [2025-02-05 17:09:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677477480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:39,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:39,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:39,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579751279] [2025-02-05 17:09:39,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:39,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:39,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:39,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:39,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:39,478 INFO L87 Difference]: Start difference. First operand 2498 states and 4522 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:39,721 INFO L93 Difference]: Finished difference Result 2893 states and 5125 transitions. [2025-02-05 17:09:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:39,722 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:39,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:39,739 INFO L225 Difference]: With dead ends: 2893 [2025-02-05 17:09:39,739 INFO L226 Difference]: Without dead ends: 2528 [2025-02-05 17:09:39,741 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:09:39,746 INFO L435 NwaCegarLoop]: 4174 mSDtfsCounter, 4322 mSDsluCounter, 8269 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4334 SdHoareTripleChecker+Valid, 12443 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:39,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4334 Valid, 12443 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:09:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-02-05 17:09:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2498. [2025-02-05 17:09:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2498 states, 2450 states have (on average 1.8183673469387756) internal successors, (4455), 2454 states have internal predecessors, (4455), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 17:09:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 4520 transitions. [2025-02-05 17:09:39,815 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 4520 transitions. Word has length 91 [2025-02-05 17:09:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:39,815 INFO L471 AbstractCegarLoop]: Abstraction has 2498 states and 4520 transitions. [2025-02-05 17:09:39,816 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 4520 transitions. [2025-02-05 17:09:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:39,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:39,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, 1] [2025-02-05 17:09:39,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:09:39,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:39,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash -784929218, now seen corresponding path program 1 times [2025-02-05 17:09:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162947625] [2025-02-05 17:09:39,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:39,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:39,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:39,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:39,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:39,994 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:09:39,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:39,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162947625] [2025-02-05 17:09:39,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162947625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:39,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:39,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:39,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114429614] [2025-02-05 17:09:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:39,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:39,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:39,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:39,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:39,995 INFO L87 Difference]: Start difference. First operand 2498 states and 4520 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:40,560 INFO L93 Difference]: Finished difference Result 3085 states and 5404 transitions. [2025-02-05 17:09:40,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:40,560 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:40,568 INFO L225 Difference]: With dead ends: 3085 [2025-02-05 17:09:40,568 INFO L226 Difference]: Without dead ends: 2720 [2025-02-05 17:09:40,569 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:09:40,570 INFO L435 NwaCegarLoop]: 4334 mSDtfsCounter, 4438 mSDsluCounter, 12996 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 17330 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:40,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 17330 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:09:40,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2025-02-05 17:09:40,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2669. [2025-02-05 17:09:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2601 states have (on average 1.7985390234525183) internal successors, (4678), 2606 states have internal predecessors, (4678), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-02-05 17:09:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 4772 transitions. [2025-02-05 17:09:40,618 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 4772 transitions. Word has length 91 [2025-02-05 17:09:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:40,618 INFO L471 AbstractCegarLoop]: Abstraction has 2669 states and 4772 transitions. [2025-02-05 17:09:40,619 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 4772 transitions. [2025-02-05 17:09:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:40,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:40,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:40,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:09:40,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:40,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -341317795, now seen corresponding path program 1 times [2025-02-05 17:09:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528030063] [2025-02-05 17:09:40,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:40,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:40,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:40,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:40,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:40,735 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:09:40,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:40,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528030063] [2025-02-05 17:09:40,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528030063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:40,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:40,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:40,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225418685] [2025-02-05 17:09:40,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:40,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:40,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:40,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:40,737 INFO L87 Difference]: Start difference. First operand 2669 states and 4772 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:41,256 INFO L93 Difference]: Finished difference Result 3617 states and 6197 transitions. [2025-02-05 17:09:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:41,257 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:41,268 INFO L225 Difference]: With dead ends: 3617 [2025-02-05 17:09:41,268 INFO L226 Difference]: Without dead ends: 3081 [2025-02-05 17:09:41,271 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:09:41,272 INFO L435 NwaCegarLoop]: 4330 mSDtfsCounter, 4433 mSDsluCounter, 12984 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4445 SdHoareTripleChecker+Valid, 17314 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:41,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4445 Valid, 17314 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:09:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2025-02-05 17:09:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 3026. [2025-02-05 17:09:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3026 states, 2916 states have (on average 1.7650891632373114) internal successors, (5147), 2925 states have internal predecessors, (5147), 72 states have call successors, (72), 31 states have call predecessors, (72), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-02-05 17:09:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 5305 transitions. [2025-02-05 17:09:41,353 INFO L78 Accepts]: Start accepts. Automaton has 3026 states and 5305 transitions. Word has length 91 [2025-02-05 17:09:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:41,353 INFO L471 AbstractCegarLoop]: Abstraction has 3026 states and 5305 transitions. [2025-02-05 17:09:41,353 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3026 states and 5305 transitions. [2025-02-05 17:09:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:41,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:41,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:41,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:09:41,357 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:41,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1296839074, now seen corresponding path program 1 times [2025-02-05 17:09:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:41,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239643286] [2025-02-05 17:09:41,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:41,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:41,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:41,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:41,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:41,477 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:09:41,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239643286] [2025-02-05 17:09:41,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239643286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:41,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854246030] [2025-02-05 17:09:41,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:41,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:41,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:41,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:41,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:41,480 INFO L87 Difference]: Start difference. First operand 3026 states and 5305 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:42,042 INFO L93 Difference]: Finished difference Result 4736 states and 7896 transitions. [2025-02-05 17:09:42,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:42,042 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:42,061 INFO L225 Difference]: With dead ends: 4736 [2025-02-05 17:09:42,062 INFO L226 Difference]: Without dead ends: 3843 [2025-02-05 17:09:42,065 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:09:42,066 INFO L435 NwaCegarLoop]: 4327 mSDtfsCounter, 4428 mSDsluCounter, 12975 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4440 SdHoareTripleChecker+Valid, 17302 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:42,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4440 Valid, 17302 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:09:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3843 states. [2025-02-05 17:09:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3843 to 3779. [2025-02-05 17:09:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3779 states, 3579 states have (on average 1.7164012293936854) internal successors, (6143), 3602 states have internal predecessors, (6143), 124 states have call successors, (124), 55 states have call predecessors, (124), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-02-05 17:09:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3779 states to 3779 states and 6453 transitions. [2025-02-05 17:09:42,228 INFO L78 Accepts]: Start accepts. Automaton has 3779 states and 6453 transitions. Word has length 91 [2025-02-05 17:09:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:42,228 INFO L471 AbstractCegarLoop]: Abstraction has 3779 states and 6453 transitions. [2025-02-05 17:09:42,229 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3779 states and 6453 transitions. [2025-02-05 17:09:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:42,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:42,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:42,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:09:42,231 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:42,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash 889094973, now seen corresponding path program 1 times [2025-02-05 17:09:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930492016] [2025-02-05 17:09:42,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:42,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:42,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:42,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:42,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:42,338 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:09:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:42,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930492016] [2025-02-05 17:09:42,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930492016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:42,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:42,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360908225] [2025-02-05 17:09:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:42,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:42,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:42,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:42,340 INFO L87 Difference]: Start difference. First operand 3779 states and 6453 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:42,916 INFO L93 Difference]: Finished difference Result 7375 states and 12003 transitions. [2025-02-05 17:09:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:42,916 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:42,939 INFO L225 Difference]: With dead ends: 7375 [2025-02-05 17:09:42,939 INFO L226 Difference]: Without dead ends: 5729 [2025-02-05 17:09:42,945 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:09:42,946 INFO L435 NwaCegarLoop]: 4322 mSDtfsCounter, 4557 mSDsluCounter, 12955 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 17277 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:42,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 17277 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:09:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2025-02-05 17:09:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 5360. [2025-02-05 17:09:43,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5360 states, 4970 states have (on average 1.6617706237424548) internal successors, (8259), 5039 states have internal predecessors, (8259), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 17:09:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 8953 transitions. [2025-02-05 17:09:43,122 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 8953 transitions. Word has length 91 [2025-02-05 17:09:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:43,122 INFO L471 AbstractCegarLoop]: Abstraction has 5360 states and 8953 transitions. [2025-02-05 17:09:43,123 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 8953 transitions. [2025-02-05 17:09:43,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:43,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:43,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:43,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:09:43,126 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:43,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:43,126 INFO L85 PathProgramCache]: Analyzing trace with hash 405419646, now seen corresponding path program 1 times [2025-02-05 17:09:43,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:43,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045663021] [2025-02-05 17:09:43,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:43,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:43,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:43,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:43,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:43,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:43,184 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:09:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:43,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045663021] [2025-02-05 17:09:43,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045663021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:43,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:43,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:43,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771080710] [2025-02-05 17:09:43,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:43,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:43,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:43,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:43,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:43,186 INFO L87 Difference]: Start difference. First operand 5360 states and 8953 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:43,435 INFO L93 Difference]: Finished difference Result 9002 states and 14802 transitions. [2025-02-05 17:09:43,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:43,436 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:43,457 INFO L225 Difference]: With dead ends: 9002 [2025-02-05 17:09:43,457 INFO L226 Difference]: Without dead ends: 5775 [2025-02-05 17:09:43,466 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:09:43,467 INFO L435 NwaCegarLoop]: 4154 mSDtfsCounter, 4320 mSDsluCounter, 8237 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4332 SdHoareTripleChecker+Valid, 12391 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:43,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4332 Valid, 12391 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:09:43,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2025-02-05 17:09:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 5360. [2025-02-05 17:09:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5360 states, 4970 states have (on average 1.6583501006036216) internal successors, (8242), 5039 states have internal predecessors, (8242), 220 states have call successors, (220), 103 states have call predecessors, (220), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 17:09:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5360 states to 5360 states and 8936 transitions. [2025-02-05 17:09:43,664 INFO L78 Accepts]: Start accepts. Automaton has 5360 states and 8936 transitions. Word has length 91 [2025-02-05 17:09:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:43,664 INFO L471 AbstractCegarLoop]: Abstraction has 5360 states and 8936 transitions. [2025-02-05 17:09:43,664 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5360 states and 8936 transitions. [2025-02-05 17:09:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:43,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:43,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:43,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:09:43,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:43,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1359648541, now seen corresponding path program 1 times [2025-02-05 17:09:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:43,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966030198] [2025-02-05 17:09:43,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:43,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:43,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:43,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:43,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:43,741 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:09:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966030198] [2025-02-05 17:09:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966030198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:43,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:43,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:09:43,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482102551] [2025-02-05 17:09:43,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:43,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:09:43,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:43,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:09:43,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:43,743 INFO L87 Difference]: Start difference. First operand 5360 states and 8936 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:44,586 INFO L93 Difference]: Finished difference Result 12330 states and 20074 transitions. [2025-02-05 17:09:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:09:44,586 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:44,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:44,654 INFO L225 Difference]: With dead ends: 12330 [2025-02-05 17:09:44,655 INFO L226 Difference]: Without dead ends: 9103 [2025-02-05 17:09:44,666 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:09:44,667 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 4484 mSDsluCounter, 12932 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4501 SdHoareTripleChecker+Valid, 17246 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:44,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4501 Valid, 17246 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:09:44,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9103 states. [2025-02-05 17:09:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9103 to 8660. [2025-02-05 17:09:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8660 states, 7844 states have (on average 1.6058133605303417) internal successors, (12596), 8059 states have internal predecessors, (12596), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:09:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 14426 transitions. [2025-02-05 17:09:45,071 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 14426 transitions. Word has length 91 [2025-02-05 17:09:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:45,075 INFO L471 AbstractCegarLoop]: Abstraction has 8660 states and 14426 transitions. [2025-02-05 17:09:45,076 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 14426 transitions. [2025-02-05 17:09:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:45,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:45,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:45,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:09:45,089 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:45,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1113335454, now seen corresponding path program 1 times [2025-02-05 17:09:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:45,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063883620] [2025-02-05 17:09:45,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:45,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:45,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:45,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:45,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:45,150 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:09:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063883620] [2025-02-05 17:09:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063883620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:45,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:45,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194822197] [2025-02-05 17:09:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:45,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:45,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:45,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:45,152 INFO L87 Difference]: Start difference. First operand 8660 states and 14426 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:45,632 INFO L93 Difference]: Finished difference Result 15922 states and 26702 transitions. [2025-02-05 17:09:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:45,633 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:45,668 INFO L225 Difference]: With dead ends: 15922 [2025-02-05 17:09:45,668 INFO L226 Difference]: Without dead ends: 9395 [2025-02-05 17:09:45,685 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:09:45,688 INFO L435 NwaCegarLoop]: 4158 mSDtfsCounter, 4309 mSDsluCounter, 8237 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 12395 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:45,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 12395 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:09:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9395 states. [2025-02-05 17:09:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9395 to 8660. [2025-02-05 17:09:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8660 states, 7844 states have (on average 1.6016063233044364) internal successors, (12563), 8059 states have internal predecessors, (12563), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:09:46,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 14393 transitions. [2025-02-05 17:09:46,161 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 14393 transitions. Word has length 91 [2025-02-05 17:09:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:46,161 INFO L471 AbstractCegarLoop]: Abstraction has 8660 states and 14393 transitions. [2025-02-05 17:09:46,161 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 14393 transitions. [2025-02-05 17:09:46,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:46,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:46,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:46,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:09:46,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:46,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash -557178115, now seen corresponding path program 1 times [2025-02-05 17:09:46,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:46,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700000588] [2025-02-05 17:09:46,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:46,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:46,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:46,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:46,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:46,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:09:46,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:46,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700000588] [2025-02-05 17:09:46,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700000588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:46,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:46,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:09:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194750671] [2025-02-05 17:09:46,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:46,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:09:46,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:46,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:09:46,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:09:46,382 INFO L87 Difference]: Start difference. First operand 8660 states and 14393 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:46,938 INFO L93 Difference]: Finished difference Result 15677 states and 26146 transitions. [2025-02-05 17:09:46,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:46,939 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:46,967 INFO L225 Difference]: With dead ends: 15677 [2025-02-05 17:09:46,967 INFO L226 Difference]: Without dead ends: 9150 [2025-02-05 17:09:46,979 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:09:46,980 INFO L435 NwaCegarLoop]: 4155 mSDtfsCounter, 4306 mSDsluCounter, 8232 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4318 SdHoareTripleChecker+Valid, 12387 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:46,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4318 Valid, 12387 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:09:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9150 states. [2025-02-05 17:09:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9150 to 8660. [2025-02-05 17:09:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8660 states, 7844 states have (on average 1.5973992860785313) internal successors, (12530), 8059 states have internal predecessors, (12530), 404 states have call successors, (404), 199 states have call predecessors, (404), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:09:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 14360 transitions. [2025-02-05 17:09:47,404 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 14360 transitions. Word has length 91 [2025-02-05 17:09:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:47,404 INFO L471 AbstractCegarLoop]: Abstraction has 8660 states and 14360 transitions. [2025-02-05 17:09:47,404 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 14360 transitions. [2025-02-05 17:09:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:09:47,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:47,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:09:47,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:09:47,409 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:47,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:47,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1165254978, now seen corresponding path program 1 times [2025-02-05 17:09:47,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:47,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597952369] [2025-02-05 17:09:47,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:47,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:47,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:09:47,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:09:47,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:47,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:47,461 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:09:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:47,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597952369] [2025-02-05 17:09:47,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597952369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:09:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:09:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098670109] [2025-02-05 17:09:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:47,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:09:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:47,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:09:47,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:09:47,463 INFO L87 Difference]: Start difference. First operand 8660 states and 14360 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:48,249 INFO L93 Difference]: Finished difference Result 21377 states and 34893 transitions. [2025-02-05 17:09:48,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:09:48,249 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:09:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:48,291 INFO L225 Difference]: With dead ends: 21377 [2025-02-05 17:09:48,291 INFO L226 Difference]: Without dead ends: 14851 [2025-02-05 17:09:48,307 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:09:48,308 INFO L435 NwaCegarLoop]: 4474 mSDtfsCounter, 4434 mSDsluCounter, 4405 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4434 SdHoareTripleChecker+Valid, 8879 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:09:48,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4434 Valid, 8879 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:09:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14851 states. [2025-02-05 17:09:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14851 to 14818. [2025-02-05 17:09:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14818 states, 13194 states have (on average 1.538123389419433) internal successors, (20294), 13654 states have internal predecessors, (20294), 802 states have call successors, (802), 397 states have call predecessors, (802), 820 states have return successors, (2817), 798 states have call predecessors, (2817), 800 states have call successors, (2817) [2025-02-05 17:09:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14818 states to 14818 states and 23913 transitions. [2025-02-05 17:09:48,862 INFO L78 Accepts]: Start accepts. Automaton has 14818 states and 23913 transitions. Word has length 91 [2025-02-05 17:09:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:48,862 INFO L471 AbstractCegarLoop]: Abstraction has 14818 states and 23913 transitions. [2025-02-05 17:09:48,862 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:09:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 14818 states and 23913 transitions. [2025-02-05 17:09:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 17:09:48,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:48,886 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, 1] [2025-02-05 17:09:48,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:09:48,886 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:48,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash -362071702, now seen corresponding path program 1 times [2025-02-05 17:09:48,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:48,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385503962] [2025-02-05 17:09:48,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:48,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:48,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:09:48,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:09:48,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:48,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:48,954 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:09:48,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385503962] [2025-02-05 17:09:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385503962] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:09:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513995436] [2025-02-05 17:09:48,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:48,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:09:48,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:09:48,957 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:09:48,959 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:09:49,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:09:49,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:09:49,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:49,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:49,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:09:49,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:09:49,262 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:09:49,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:09:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513995436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:09:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:09:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305298308] [2025-02-05 17:09:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:49,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:09:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:49,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:09:49,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:49,270 INFO L87 Difference]: Start difference. First operand 14818 states and 23913 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:09:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:50,523 INFO L93 Difference]: Finished difference Result 39855 states and 63621 transitions. [2025-02-05 17:09:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:09:50,523 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 149 [2025-02-05 17:09:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:50,625 INFO L225 Difference]: With dead ends: 39855 [2025-02-05 17:09:50,625 INFO L226 Difference]: Without dead ends: 27171 [2025-02-05 17:09:50,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 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:09:50,653 INFO L435 NwaCegarLoop]: 4238 mSDtfsCounter, 4191 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4191 SdHoareTripleChecker+Valid, 4492 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:09:50,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4191 Valid, 4492 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:09:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27171 states. [2025-02-05 17:09:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27171 to 26969. [2025-02-05 17:09:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26969 states, 23795 states have (on average 1.5109897037192688) internal successors, (35954), 24712 states have internal predecessors, (35954), 1532 states have call successors, (1532), 793 states have call predecessors, (1532), 1640 states have return successors, (5533), 1495 states have call predecessors, (5533), 1530 states have call successors, (5533) [2025-02-05 17:09:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26969 states to 26969 states and 43019 transitions. [2025-02-05 17:09:52,257 INFO L78 Accepts]: Start accepts. Automaton has 26969 states and 43019 transitions. Word has length 149 [2025-02-05 17:09:52,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:52,258 INFO L471 AbstractCegarLoop]: Abstraction has 26969 states and 43019 transitions. [2025-02-05 17:09:52,258 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:09:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 26969 states and 43019 transitions. [2025-02-05 17:09:52,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 17:09:52,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:52,303 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, 1] [2025-02-05 17:09:52,310 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:09:52,507 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:09:52,507 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:52,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:52,508 INFO L85 PathProgramCache]: Analyzing trace with hash 665905444, now seen corresponding path program 1 times [2025-02-05 17:09:52,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:52,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764926112] [2025-02-05 17:09:52,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:52,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:52,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:09:52,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:09:52,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:52,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:52,572 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:09:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:52,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764926112] [2025-02-05 17:09:52,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764926112] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:09:52,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024585465] [2025-02-05 17:09:52,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:52,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:09:52,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:09:52,577 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:09:52,585 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:09:52,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:09:52,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:09:52,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:52,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:52,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:09:52,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:09:52,753 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:09:52,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:09:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024585465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:09:52,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:09:52,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969686037] [2025-02-05 17:09:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:52,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:09:52,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:52,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:09:52,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:52,756 INFO L87 Difference]: Start difference. First operand 26969 states and 43019 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:09:54,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:09:54,322 INFO L93 Difference]: Finished difference Result 75978 states and 120745 transitions. [2025-02-05 17:09:54,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:09:54,323 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 149 [2025-02-05 17:09:54,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:09:54,500 INFO L225 Difference]: With dead ends: 75978 [2025-02-05 17:09:54,500 INFO L226 Difference]: Without dead ends: 51143 [2025-02-05 17:09:54,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 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:09:54,549 INFO L435 NwaCegarLoop]: 4238 mSDtfsCounter, 4185 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4185 SdHoareTripleChecker+Valid, 4492 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:09:54,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4185 Valid, 4492 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:09:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51143 states. [2025-02-05 17:09:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51143 to 50743. [2025-02-05 17:09:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50743 states, 44535 states have (on average 1.4957673739755248) internal successors, (66614), 46366 states have internal predecessors, (66614), 2926 states have call successors, (2926), 1585 states have call predecessors, (2926), 3280 states have return successors, (10899), 2823 states have call predecessors, (10899), 2924 states have call successors, (10899) [2025-02-05 17:09:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50743 states to 50743 states and 80439 transitions. [2025-02-05 17:09:57,313 INFO L78 Accepts]: Start accepts. Automaton has 50743 states and 80439 transitions. Word has length 149 [2025-02-05 17:09:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:09:57,313 INFO L471 AbstractCegarLoop]: Abstraction has 50743 states and 80439 transitions. [2025-02-05 17:09:57,313 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:09:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 50743 states and 80439 transitions. [2025-02-05 17:09:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 17:09:57,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:09:57,351 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, 1] [2025-02-05 17:09:57,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:09:57,552 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:09:57,552 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:09:57,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:09:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2012965982, now seen corresponding path program 1 times [2025-02-05 17:09:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:09:57,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518664525] [2025-02-05 17:09:57,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:09:57,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:09:57,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:09:57,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:57,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:57,612 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:09:57,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:09:57,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518664525] [2025-02-05 17:09:57,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518664525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:09:57,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256521044] [2025-02-05 17:09:57,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:09:57,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:09:57,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:09:57,614 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:09:57,616 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:09:57,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:09:57,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:09:57,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:09:57,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:09:57,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:09:57,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:09:57,750 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:09:57,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:09:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256521044] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:09:57,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:09:57,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:09:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799845959] [2025-02-05 17:09:57,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:09:57,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:09:57,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:09:57,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:09:57,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:09:57,753 INFO L87 Difference]: Start difference. First operand 50743 states and 80439 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:10:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:01,898 INFO L93 Difference]: Finished difference Result 147024 states and 233191 transitions. [2025-02-05 17:10:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:10:01,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 149 [2025-02-05 17:10:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:02,550 INFO L225 Difference]: With dead ends: 147024 [2025-02-05 17:10:02,550 INFO L226 Difference]: Without dead ends: 98415 [2025-02-05 17:10:02,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 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:10:02,691 INFO L435 NwaCegarLoop]: 4238 mSDtfsCounter, 4197 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4197 SdHoareTripleChecker+Valid, 4492 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:10:02,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4197 Valid, 4492 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:10:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98415 states. [2025-02-05 17:10:06,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98415 to 97619. [2025-02-05 17:10:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97619 states, 85347 states have (on average 1.4865197370733594) internal successors, (126870), 89006 states have internal predecessors, (126870), 5710 states have call successors, (5710), 3169 states have call predecessors, (5710), 6560 states have return successors, (21627), 5475 states have call predecessors, (21627), 5708 states have call successors, (21627) [2025-02-05 17:10:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97619 states to 97619 states and 154207 transitions. [2025-02-05 17:10:07,582 INFO L78 Accepts]: Start accepts. Automaton has 97619 states and 154207 transitions. Word has length 149 [2025-02-05 17:10:07,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:07,582 INFO L471 AbstractCegarLoop]: Abstraction has 97619 states and 154207 transitions. [2025-02-05 17:10:07,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:10:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 97619 states and 154207 transitions. [2025-02-05 17:10:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 17:10:07,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:07,728 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, 1] [2025-02-05 17:10:07,739 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:10:07,929 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:10:07,929 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:07,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1085740904, now seen corresponding path program 1 times [2025-02-05 17:10:07,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:07,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638158660] [2025-02-05 17:10:07,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:07,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:07,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:10:07,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:10:07,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:07,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:07,991 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:10:07,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:07,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638158660] [2025-02-05 17:10:07,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638158660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:10:07,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649252305] [2025-02-05 17:10:07,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:07,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:10:07,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:10:07,995 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:10:07,997 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:10:08,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 17:10:08,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 17:10:08,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:08,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:08,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:10:08,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:10:08,159 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:10:08,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:10:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649252305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:08,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:10:08,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:10:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968723038] [2025-02-05 17:10:08,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:08,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:10:08,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:08,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:10:08,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:08,164 INFO L87 Difference]: Start difference. First operand 97619 states and 154207 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)