./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9e8eec1743df688e821561fda517f1945d9b8e3e5029879578d4191f60280f1b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:07:20,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:07:20,629 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:07:20,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:07:20,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:07:20,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:07:20,647 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:07:20,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:07:20,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:07:20,647 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:07:20,647 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:07:20,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:07:20,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:07:20,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:07:20,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:07:20,649 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:07:20,649 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:07:20,649 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:07:20,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:07:20,649 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:07:20,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:07:20,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:07:20,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:07:20,651 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 -> 9e8eec1743df688e821561fda517f1945d9b8e3e5029879578d4191f60280f1b [2025-02-05 17:07:20,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:07:20,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:07:20,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:07:20,844 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:07:20,844 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:07:20,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c [2025-02-05 17:07:22,095 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca5c9e4ed/3023dc1a76ad47e18ccacffb035795e4/FLAGa377e62c0 [2025-02-05 17:07:22,666 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:07:22,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.04.cil-1.c [2025-02-05 17:07:22,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca5c9e4ed/3023dc1a76ad47e18ccacffb035795e4/FLAGa377e62c0 [2025-02-05 17:07:23,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca5c9e4ed/3023dc1a76ad47e18ccacffb035795e4 [2025-02-05 17:07:23,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:07:23,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:07:23,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:07:23,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:07:23,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:07:23,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:07:23" (1/1) ... [2025-02-05 17:07:23,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caa8ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:23, skipping insertion in model container [2025-02-05 17:07:23,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:07:23" (1/1) ... [2025-02-05 17:07:23,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:07:24,569 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_label42+token_ring.04.cil-1.c[378560,378573] [2025-02-05 17:07:24,599 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_label42+token_ring.04.cil-1.c[383339,383352] [2025-02-05 17:07:24,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:07:24,732 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:07:25,326 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_label42+token_ring.04.cil-1.c[378560,378573] [2025-02-05 17:07:25,331 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_label42+token_ring.04.cil-1.c[383339,383352] [2025-02-05 17:07:25,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:07:25,378 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:07:25,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25 WrapperNode [2025-02-05 17:07:25,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:07:25,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:07:25,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:07:25,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:07:25,385 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:07:25" (1/1) ... [2025-02-05 17:07:25,431 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:07:25" (1/1) ... [2025-02-05 17:07:25,681 INFO L138 Inliner]: procedures = 52, calls = 53, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 12729 [2025-02-05 17:07:25,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:07:25,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:07:25,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:07:25,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:07:25,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:25,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:25,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:25,805 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:07:25,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:25,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:25,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:25,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:26,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:26,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:26,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:07:26,062 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:07:26,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:07:26,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:07:26,063 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (1/1) ... [2025-02-05 17:07:26,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:07:26,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:07:26,089 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:07:26,091 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:07:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:07:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:07:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:07:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:07:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:07:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:07:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:07:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:07:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:07:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:07:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:07:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:07:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:07:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:07:26,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:07:26,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:07:26,279 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:07:26,281 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:07:33,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:07:33,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:07:33,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:07:33,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:07:33,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:07:33,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:07:33,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:07:33,344 INFO L? ?]: Removed 1707 outVars from TransFormulas that were not future-live. [2025-02-05 17:07:33,345 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:07:33,414 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:07:33,418 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:07:33,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:07:33 BoogieIcfgContainer [2025-02-05 17:07:33,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:07:33,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:07:33,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:07:33,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:07:33,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:07:23" (1/3) ... [2025-02-05 17:07:33,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670e76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:07:33, skipping insertion in model container [2025-02-05 17:07:33,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:07:25" (2/3) ... [2025-02-05 17:07:33,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670e76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:07:33, skipping insertion in model container [2025-02-05 17:07:33,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:07:33" (3/3) ... [2025-02-05 17:07:33,438 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.04.cil-1.c [2025-02-05 17:07:33,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:07:33,466 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.04.cil-1.c that has 7 procedures, 2375 locations, 1 initial locations, 8 loop locations, and 2 error locations. [2025-02-05 17:07:33,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:07:33,641 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;@1a27d693, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:07:33,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:07:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 2375 states, 2348 states have (on average 1.8471039182282794) internal successors, (4337), 2351 states have internal predecessors, (4337), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 17:07:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:33,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:33,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:33,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:33,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2045429622, now seen corresponding path program 1 times [2025-02-05 17:07:33,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:33,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385501316] [2025-02-05 17:07:33,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:33,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:33,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:33,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:33,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:34,058 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:07:34,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:34,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385501316] [2025-02-05 17:07:34,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385501316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:34,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:34,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:34,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022029996] [2025-02-05 17:07:34,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:34,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:34,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:34,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:34,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:34,084 INFO L87 Difference]: Start difference. First operand has 2375 states, 2348 states have (on average 1.8471039182282794) internal successors, (4337), 2351 states have internal predecessors, (4337), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:34,660 INFO L93 Difference]: Finished difference Result 4932 states and 9029 transitions. [2025-02-05 17:07:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:07:34,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:34,678 INFO L225 Difference]: With dead ends: 4932 [2025-02-05 17:07:34,678 INFO L226 Difference]: Without dead ends: 2499 [2025-02-05 17:07:34,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:07:34,687 INFO L435 NwaCegarLoop]: 4244 mSDtfsCounter, 4506 mSDsluCounter, 8599 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4518 SdHoareTripleChecker+Valid, 12843 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:34,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4518 Valid, 12843 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:07:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2025-02-05 17:07:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2486. [2025-02-05 17:07:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2440 states have (on average 1.8184426229508197) internal successors, (4437), 2443 states have internal predecessors, (4437), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 17:07:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4500 transitions. [2025-02-05 17:07:34,791 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4500 transitions. Word has length 90 [2025-02-05 17:07:34,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:34,792 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4500 transitions. [2025-02-05 17:07:34,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:34,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4500 transitions. [2025-02-05 17:07:34,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:34,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:34,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:34,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:07:34,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:34,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:34,795 INFO L85 PathProgramCache]: Analyzing trace with hash -689383752, now seen corresponding path program 1 times [2025-02-05 17:07:34,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:34,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127137205] [2025-02-05 17:07:34,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:34,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:34,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:34,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:34,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:34,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:34,985 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:07:34,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:34,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127137205] [2025-02-05 17:07:34,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127137205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:34,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684008978] [2025-02-05 17:07:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:34,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:34,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:34,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:34,991 INFO L87 Difference]: Start difference. First operand 2486 states and 4500 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:35,217 INFO L93 Difference]: Finished difference Result 2869 states and 5081 transitions. [2025-02-05 17:07:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:35,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:35,226 INFO L225 Difference]: With dead ends: 2869 [2025-02-05 17:07:35,226 INFO L226 Difference]: Without dead ends: 2516 [2025-02-05 17:07:35,228 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:07:35,230 INFO L435 NwaCegarLoop]: 4163 mSDtfsCounter, 4309 mSDsluCounter, 8251 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 12414 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:35,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 12414 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:07:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2025-02-05 17:07:35,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2486. [2025-02-05 17:07:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2440 states have (on average 1.8176229508196722) internal successors, (4435), 2443 states have internal predecessors, (4435), 31 states have call successors, (31), 12 states have call predecessors, (31), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 17:07:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4498 transitions. [2025-02-05 17:07:35,282 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4498 transitions. Word has length 90 [2025-02-05 17:07:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:35,282 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4498 transitions. [2025-02-05 17:07:35,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4498 transitions. [2025-02-05 17:07:35,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:35,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:35,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:35,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:07:35,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:35,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:35,285 INFO L85 PathProgramCache]: Analyzing trace with hash -245772329, now seen corresponding path program 1 times [2025-02-05 17:07:35,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:35,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245711080] [2025-02-05 17:07:35,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:35,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:35,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:35,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:35,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:35,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:35,438 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:07:35,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:35,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245711080] [2025-02-05 17:07:35,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245711080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:35,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:35,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991481474] [2025-02-05 17:07:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:35,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:35,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:35,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:35,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:35,440 INFO L87 Difference]: Start difference. First operand 2486 states and 4498 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:36,050 INFO L93 Difference]: Finished difference Result 3054 states and 5348 transitions. [2025-02-05 17:07:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:36,061 INFO L225 Difference]: With dead ends: 3054 [2025-02-05 17:07:36,061 INFO L226 Difference]: Without dead ends: 2701 [2025-02-05 17:07:36,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:07:36,064 INFO L435 NwaCegarLoop]: 4312 mSDtfsCounter, 4425 mSDsluCounter, 12931 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4437 SdHoareTripleChecker+Valid, 17243 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:36,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4437 Valid, 17243 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:07:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-02-05 17:07:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2652. [2025-02-05 17:07:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2586 states have (on average 1.797370456303171) internal successors, (4648), 2590 states have internal predecessors, (4648), 44 states have call successors, (44), 18 states have call predecessors, (44), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-02-05 17:07:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 4740 transitions. [2025-02-05 17:07:36,133 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 4740 transitions. Word has length 90 [2025-02-05 17:07:36,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:36,133 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 4740 transitions. [2025-02-05 17:07:36,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 4740 transitions. [2025-02-05 17:07:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:36,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:36,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:36,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:07:36,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:36,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1201293608, now seen corresponding path program 1 times [2025-02-05 17:07:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191567456] [2025-02-05 17:07:36,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:36,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:36,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:36,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:36,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:36,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:36,283 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:07:36,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:36,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191567456] [2025-02-05 17:07:36,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191567456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:36,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:36,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133353638] [2025-02-05 17:07:36,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:36,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:36,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:36,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:36,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:36,285 INFO L87 Difference]: Start difference. First operand 2652 states and 4740 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:36,680 INFO L93 Difference]: Finished difference Result 3571 states and 6111 transitions. [2025-02-05 17:07:36,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:36,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:36,690 INFO L225 Difference]: With dead ends: 3571 [2025-02-05 17:07:36,691 INFO L226 Difference]: Without dead ends: 3052 [2025-02-05 17:07:36,693 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:07:36,693 INFO L435 NwaCegarLoop]: 4308 mSDtfsCounter, 4420 mSDsluCounter, 12919 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4432 SdHoareTripleChecker+Valid, 17227 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:36,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4432 Valid, 17227 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:07:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2025-02-05 17:07:36,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2999. [2025-02-05 17:07:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2999 states, 2891 states have (on average 1.763057765479073) internal successors, (5097), 2899 states have internal predecessors, (5097), 70 states have call successors, (70), 30 states have call predecessors, (70), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-02-05 17:07:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 5253 transitions. [2025-02-05 17:07:36,764 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 5253 transitions. Word has length 90 [2025-02-05 17:07:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:36,765 INFO L471 AbstractCegarLoop]: Abstraction has 2999 states and 5253 transitions. [2025-02-05 17:07:36,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 5253 transitions. [2025-02-05 17:07:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:36,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:36,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:36,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:07:36,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:36,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash 984640439, now seen corresponding path program 1 times [2025-02-05 17:07:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:36,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480176181] [2025-02-05 17:07:36,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:36,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:36,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:36,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:36,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:36,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:36,860 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:07:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480176181] [2025-02-05 17:07:36,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480176181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:36,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:36,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781262974] [2025-02-05 17:07:36,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:36,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:36,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:36,861 INFO L87 Difference]: Start difference. First operand 2999 states and 5253 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:37,370 INFO L93 Difference]: Finished difference Result 4660 states and 7750 transitions. [2025-02-05 17:07:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:37,390 INFO L225 Difference]: With dead ends: 4660 [2025-02-05 17:07:37,390 INFO L226 Difference]: Without dead ends: 3794 [2025-02-05 17:07:37,395 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:07:37,398 INFO L435 NwaCegarLoop]: 4305 mSDtfsCounter, 4415 mSDsluCounter, 12910 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4427 SdHoareTripleChecker+Valid, 17215 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:37,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4427 Valid, 17215 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:07:37,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2025-02-05 17:07:37,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3732. [2025-02-05 17:07:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3732 states, 3534 states have (on average 1.712790039615167) internal successors, (6053), 3556 states have internal predecessors, (6053), 122 states have call successors, (122), 54 states have call predecessors, (122), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-02-05 17:07:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3732 states to 3732 states and 6361 transitions. [2025-02-05 17:07:37,547 INFO L78 Accepts]: Start accepts. Automaton has 3732 states and 6361 transitions. Word has length 90 [2025-02-05 17:07:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:37,547 INFO L471 AbstractCegarLoop]: Abstraction has 3732 states and 6361 transitions. [2025-02-05 17:07:37,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3732 states and 6361 transitions. [2025-02-05 17:07:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:37,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:37,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:37,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:07:37,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:37,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 500965112, now seen corresponding path program 1 times [2025-02-05 17:07:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360645570] [2025-02-05 17:07:37,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:37,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:37,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:37,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:37,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:37,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:37,690 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:07:37,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:37,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360645570] [2025-02-05 17:07:37,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360645570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:37,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39518826] [2025-02-05 17:07:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:37,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:37,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:37,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:37,695 INFO L87 Difference]: Start difference. First operand 3732 states and 6361 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:38,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:38,547 INFO L93 Difference]: Finished difference Result 7239 states and 11737 transitions. [2025-02-05 17:07:38,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:38,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:38,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:38,571 INFO L225 Difference]: With dead ends: 7239 [2025-02-05 17:07:38,571 INFO L226 Difference]: Without dead ends: 5640 [2025-02-05 17:07:38,577 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:07:38,578 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 4544 mSDsluCounter, 12890 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 17190 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:38,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 17190 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:07:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5640 states. [2025-02-05 17:07:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5640 to 5273. [2025-02-05 17:07:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4885 states have (on average 1.655885363357216) internal successors, (8089), 4953 states have internal predecessors, (8089), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 17:07:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 8781 transitions. [2025-02-05 17:07:38,822 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 8781 transitions. Word has length 90 [2025-02-05 17:07:38,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:38,822 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 8781 transitions. [2025-02-05 17:07:38,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 8781 transitions. [2025-02-05 17:07:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:38,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:38,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:38,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:07:38,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:38,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:38,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1455194007, now seen corresponding path program 1 times [2025-02-05 17:07:38,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:38,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256088302] [2025-02-05 17:07:38,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:38,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:38,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:38,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:38,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:38,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:38,917 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:07:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:38,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256088302] [2025-02-05 17:07:38,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256088302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:38,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658841928] [2025-02-05 17:07:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:38,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:38,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:38,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:38,919 INFO L87 Difference]: Start difference. First operand 5273 states and 8781 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:39,236 INFO L93 Difference]: Finished difference Result 8828 states and 14458 transitions. [2025-02-05 17:07:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:39,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:39,260 INFO L225 Difference]: With dead ends: 8828 [2025-02-05 17:07:39,260 INFO L226 Difference]: Without dead ends: 5688 [2025-02-05 17:07:39,271 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:07:39,272 INFO L435 NwaCegarLoop]: 4143 mSDtfsCounter, 4307 mSDsluCounter, 8219 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4319 SdHoareTripleChecker+Valid, 12362 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:39,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4319 Valid, 12362 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:07:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2025-02-05 17:07:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 5273. [2025-02-05 17:07:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 4885 states have (on average 1.652405322415558) internal successors, (8072), 4953 states have internal predecessors, (8072), 218 states have call successors, (218), 102 states have call predecessors, (218), 168 states have return successors, (474), 233 states have call predecessors, (474), 218 states have call successors, (474) [2025-02-05 17:07:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 8764 transitions. [2025-02-05 17:07:39,560 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 8764 transitions. Word has length 90 [2025-02-05 17:07:39,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:39,560 INFO L471 AbstractCegarLoop]: Abstraction has 5273 states and 8764 transitions. [2025-02-05 17:07:39,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:39,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 8764 transitions. [2025-02-05 17:07:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:39,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:39,563 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:39,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:07:39,564 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:39,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1208880920, now seen corresponding path program 1 times [2025-02-05 17:07:39,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:39,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686729343] [2025-02-05 17:07:39,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:39,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:39,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:39,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:39,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:39,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:39,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:39,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:39,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686729343] [2025-02-05 17:07:39,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686729343] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:39,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:39,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:07:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830430571] [2025-02-05 17:07:39,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:39,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:07:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:39,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:07:39,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:39,642 INFO L87 Difference]: Start difference. First operand 5273 states and 8764 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:40,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:40,184 INFO L93 Difference]: Finished difference Result 12074 states and 19568 transitions. [2025-02-05 17:07:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:07:40,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:40,212 INFO L225 Difference]: With dead ends: 12074 [2025-02-05 17:07:40,212 INFO L226 Difference]: Without dead ends: 8934 [2025-02-05 17:07:40,222 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:07:40,223 INFO L435 NwaCegarLoop]: 4292 mSDtfsCounter, 4471 mSDsluCounter, 12867 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4488 SdHoareTripleChecker+Valid, 17159 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:40,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4488 Valid, 17159 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:07:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2025-02-05 17:07:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 8493. [2025-02-05 17:07:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5973434040890742) internal successors, (12266), 7893 states have internal predecessors, (12266), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:07:40,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14094 transitions. [2025-02-05 17:07:40,516 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14094 transitions. Word has length 90 [2025-02-05 17:07:40,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:40,516 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14094 transitions. [2025-02-05 17:07:40,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14094 transitions. [2025-02-05 17:07:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:40,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:40,524 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:40,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:07:40,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:40,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:40,524 INFO L85 PathProgramCache]: Analyzing trace with hash -461632649, now seen corresponding path program 1 times [2025-02-05 17:07:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:40,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848218842] [2025-02-05 17:07:40,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:40,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:40,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:40,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:40,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:40,592 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:07:40,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:40,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848218842] [2025-02-05 17:07:40,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848218842] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:40,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:40,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386652615] [2025-02-05 17:07:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:40,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:40,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:40,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:40,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:40,594 INFO L87 Difference]: Start difference. First operand 8493 states and 14094 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:41,061 INFO L93 Difference]: Finished difference Result 15588 states and 26038 transitions. [2025-02-05 17:07:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:41,127 INFO L225 Difference]: With dead ends: 15588 [2025-02-05 17:07:41,127 INFO L226 Difference]: Without dead ends: 9228 [2025-02-05 17:07:41,166 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:07:41,169 INFO L435 NwaCegarLoop]: 4147 mSDtfsCounter, 4296 mSDsluCounter, 8219 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4308 SdHoareTripleChecker+Valid, 12366 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:41,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4308 Valid, 12366 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:07:41,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9228 states. [2025-02-05 17:07:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9228 to 8493. [2025-02-05 17:07:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5930459695272823) internal successors, (12233), 7893 states have internal predecessors, (12233), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:07:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14061 transitions. [2025-02-05 17:07:41,734 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14061 transitions. Word has length 90 [2025-02-05 17:07:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:41,735 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14061 transitions. [2025-02-05 17:07:41,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14061 transitions. [2025-02-05 17:07:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:41,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:41,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:41,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:07:41,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:41,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1069709512, now seen corresponding path program 1 times [2025-02-05 17:07:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37206633] [2025-02-05 17:07:41,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:41,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:41,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:41,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:41,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:41,809 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:07:41,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:41,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37206633] [2025-02-05 17:07:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37206633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:41,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:41,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:07:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349226077] [2025-02-05 17:07:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:41,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:07:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:41,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:07:41,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:07:41,811 INFO L87 Difference]: Start difference. First operand 8493 states and 14061 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:42,239 INFO L93 Difference]: Finished difference Result 15343 states and 25482 transitions. [2025-02-05 17:07:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:42,270 INFO L225 Difference]: With dead ends: 15343 [2025-02-05 17:07:42,270 INFO L226 Difference]: Without dead ends: 8983 [2025-02-05 17:07:42,287 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:07:42,287 INFO L435 NwaCegarLoop]: 4144 mSDtfsCounter, 4293 mSDsluCounter, 8214 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4305 SdHoareTripleChecker+Valid, 12358 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:42,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4305 Valid, 12358 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:07:42,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8983 states. [2025-02-05 17:07:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8983 to 8493. [2025-02-05 17:07:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8493 states, 7679 states have (on average 1.5887485349654904) internal successors, (12200), 7893 states have internal predecessors, (12200), 402 states have call successors, (402), 198 states have call predecessors, (402), 410 states have return successors, (1426), 433 states have call predecessors, (1426), 402 states have call successors, (1426) [2025-02-05 17:07:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8493 states to 8493 states and 14028 transitions. [2025-02-05 17:07:42,582 INFO L78 Accepts]: Start accepts. Automaton has 8493 states and 14028 transitions. Word has length 90 [2025-02-05 17:07:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:42,582 INFO L471 AbstractCegarLoop]: Abstraction has 8493 states and 14028 transitions. [2025-02-05 17:07:42,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 8493 states and 14028 transitions. [2025-02-05 17:07:42,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 17:07:42,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:42,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:42,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:07:42,587 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:42,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash 711790423, now seen corresponding path program 1 times [2025-02-05 17:07:42,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:42,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100105132] [2025-02-05 17:07:42,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:42,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:42,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 17:07:42,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 17:07:42,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:42,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:07:42,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100105132] [2025-02-05 17:07:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100105132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:42,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:07:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:07:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143097072] [2025-02-05 17:07:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:42,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:07:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:42,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:07:42,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:07:42,636 INFO L87 Difference]: Start difference. First operand 8493 states and 14028 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:43,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:43,276 INFO L93 Difference]: Finished difference Result 21043 states and 34229 transitions. [2025-02-05 17:07:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:07:43,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-02-05 17:07:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:43,319 INFO L225 Difference]: With dead ends: 21043 [2025-02-05 17:07:43,319 INFO L226 Difference]: Without dead ends: 14684 [2025-02-05 17:07:43,344 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:07:43,344 INFO L435 NwaCegarLoop]: 4462 mSDtfsCounter, 4422 mSDsluCounter, 4395 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4422 SdHoareTripleChecker+Valid, 8857 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:43,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4422 Valid, 8857 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:07:43,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14684 states. [2025-02-05 17:07:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14684 to 14651. [2025-02-05 17:07:44,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14651 states, 13029 states have (on average 1.532274157648323) internal successors, (19964), 13488 states have internal predecessors, (19964), 800 states have call successors, (800), 396 states have call predecessors, (800), 820 states have return successors, (2817), 798 states have call predecessors, (2817), 800 states have call successors, (2817) [2025-02-05 17:07:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14651 states to 14651 states and 23581 transitions. [2025-02-05 17:07:44,194 INFO L78 Accepts]: Start accepts. Automaton has 14651 states and 23581 transitions. Word has length 90 [2025-02-05 17:07:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:44,194 INFO L471 AbstractCegarLoop]: Abstraction has 14651 states and 23581 transitions. [2025-02-05 17:07:44,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:07:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 14651 states and 23581 transitions. [2025-02-05 17:07:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 17:07:44,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:44,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:44,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:07:44,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:44,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:44,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1908313067, now seen corresponding path program 1 times [2025-02-05 17:07:44,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:44,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612312966] [2025-02-05 17:07:44,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:44,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:07:44,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:07:44,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:44,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:44,277 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:07:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612312966] [2025-02-05 17:07:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612312966] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:07:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583425758] [2025-02-05 17:07:44,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:07:44,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:07:44,281 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:07:44,284 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:07:44,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:07:44,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:07:44,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:44,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:44,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:07:44,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:07:44,448 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:07:44,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:07:44,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583425758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:44,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:07:44,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:07:44,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064340775] [2025-02-05 17:07:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:44,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:07:44,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:44,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:07:44,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:44,451 INFO L87 Difference]: Start difference. First operand 14651 states and 23581 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:07:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:45,275 INFO L93 Difference]: Finished difference Result 39354 states and 62625 transitions. [2025-02-05 17:07:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:07:45,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-02-05 17:07:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:45,368 INFO L225 Difference]: With dead ends: 39354 [2025-02-05 17:07:45,368 INFO L226 Difference]: Without dead ends: 26837 [2025-02-05 17:07:45,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:45,399 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4179 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4179 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:45,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4179 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:07:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26837 states. [2025-02-05 17:07:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26837 to 26637. [2025-02-05 17:07:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26637 states, 23465 states have (on average 1.5041125079906243) internal successors, (35294), 24381 states have internal predecessors, (35294), 1530 states have call successors, (1530), 792 states have call predecessors, (1530), 1640 states have return successors, (5533), 1495 states have call predecessors, (5533), 1530 states have call successors, (5533) [2025-02-05 17:07:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26637 states to 26637 states and 42357 transitions. [2025-02-05 17:07:46,674 INFO L78 Accepts]: Start accepts. Automaton has 26637 states and 42357 transitions. Word has length 148 [2025-02-05 17:07:46,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:46,674 INFO L471 AbstractCegarLoop]: Abstraction has 26637 states and 42357 transitions. [2025-02-05 17:07:46,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:07:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 26637 states and 42357 transitions. [2025-02-05 17:07:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 17:07:46,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:46,716 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:46,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 17:07:46,916 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:07:46,917 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:46,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash -905321189, now seen corresponding path program 1 times [2025-02-05 17:07:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:46,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105224317] [2025-02-05 17:07:46,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:46,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:07:46,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:07:46,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:46,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:46,992 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:07:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:46,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105224317] [2025-02-05 17:07:46,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105224317] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:07:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368460643] [2025-02-05 17:07:46,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:07:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:07:46,996 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:07:47,005 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:07:47,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:07:47,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:07:47,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:47,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:47,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:07:47,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:07:47,181 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:07:47,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:07:47,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368460643] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:47,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:07:47,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:07:47,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797420476] [2025-02-05 17:07:47,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:47,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:07:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:47,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:07:47,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:47,183 INFO L87 Difference]: Start difference. First operand 26637 states and 42357 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:07:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:49,266 INFO L93 Difference]: Finished difference Result 74982 states and 118759 transitions. [2025-02-05 17:07:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:07:49,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-02-05 17:07:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:49,430 INFO L225 Difference]: With dead ends: 74982 [2025-02-05 17:07:49,430 INFO L226 Difference]: Without dead ends: 50479 [2025-02-05 17:07:49,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:49,481 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4173 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4173 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:49,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4173 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:07:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50479 states. [2025-02-05 17:07:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50479 to 50081. [2025-02-05 17:07:51,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50081 states, 43875 states have (on average 1.488182336182336) internal successors, (65294), 45705 states have internal predecessors, (65294), 2924 states have call successors, (2924), 1584 states have call predecessors, (2924), 3280 states have return successors, (10899), 2823 states have call predecessors, (10899), 2924 states have call successors, (10899) [2025-02-05 17:07:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50081 states to 50081 states and 79117 transitions. [2025-02-05 17:07:51,951 INFO L78 Accepts]: Start accepts. Automaton has 50081 states and 79117 transitions. Word has length 148 [2025-02-05 17:07:51,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:07:51,953 INFO L471 AbstractCegarLoop]: Abstraction has 50081 states and 79117 transitions. [2025-02-05 17:07:51,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:07:51,954 INFO L276 IsEmpty]: Start isEmpty. Operand 50081 states and 79117 transitions. [2025-02-05 17:07:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 17:07:52,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:07:52,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:07:52,015 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:07:52,209 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:07:52,209 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:07:52,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:07:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash -584772959, now seen corresponding path program 1 times [2025-02-05 17:07:52,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:07:52,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734799485] [2025-02-05 17:07:52,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:07:52,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:07:52,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:07:52,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:52,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:52,284 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:07:52,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:07:52,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734799485] [2025-02-05 17:07:52,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734799485] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:07:52,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123417012] [2025-02-05 17:07:52,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:07:52,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:07:52,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:07:52,287 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:07:52,290 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:07:52,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 17:07:52,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 17:07:52,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:07:52,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:07:52,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:07:52,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:07:52,443 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:07:52,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:07:52,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123417012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:07:52,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:07:52,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:07:52,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642159733] [2025-02-05 17:07:52,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:07:52,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:07:52,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:07:52,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:07:52,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:52,448 INFO L87 Difference]: Start difference. First operand 50081 states and 79117 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:07:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:07:56,376 INFO L93 Difference]: Finished difference Result 145038 states and 229225 transitions. [2025-02-05 17:07:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:07:56,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 148 [2025-02-05 17:07:56,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:07:56,805 INFO L225 Difference]: With dead ends: 145038 [2025-02-05 17:07:56,806 INFO L226 Difference]: Without dead ends: 97091 [2025-02-05 17:07:56,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:07:56,944 INFO L435 NwaCegarLoop]: 4226 mSDtfsCounter, 4185 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4185 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:07:56,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4185 Valid, 4468 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:07:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97091 states.