./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label44+token_ring.07.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_label44+token_ring.07.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 0c711e78fce30df46f5383f1c4f7f14d04991b46d5fa8feba742040345837246 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:11:34,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:11:34,924 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:11:34,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:11:34,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:11:34,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:11:34,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:11:34,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:11:34,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:11:34,953 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:11:34,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:11:34,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:11:34,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:11:34,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:11:34,953 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:11:34,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:11:34,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:11:34,955 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:11:34,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:11:34,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:11:34,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:11:34,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:11:34,956 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:11:34,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:11:34,956 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:11:34,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:11:34,956 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:11:34,956 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:11:34,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:11:34,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:11:34,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:11:34,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:11:34,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:11:34,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:11:34,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:11:34,957 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:11:34,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:11:34,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:11:34,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:11:34,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:11:34,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:11:34,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:11:34,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:11:34,958 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 -> 0c711e78fce30df46f5383f1c4f7f14d04991b46d5fa8feba742040345837246 [2025-02-05 17:11:35,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:11:35,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:11:35,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:11:35,179 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:11:35,179 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:11:35,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label44+token_ring.07.cil-1.c [2025-02-05 17:11:36,276 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85bcfccab/fe4349da1bac49ff9e379df043f2f911/FLAGea6c53e13 [2025-02-05 17:11:36,867 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:11:36,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label44+token_ring.07.cil-1.c [2025-02-05 17:11:36,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85bcfccab/fe4349da1bac49ff9e379df043f2f911/FLAGea6c53e13 [2025-02-05 17:11:37,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85bcfccab/fe4349da1bac49ff9e379df043f2f911 [2025-02-05 17:11:37,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:11:37,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:11:37,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:11:37,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:11:37,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:11:37,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:11:37" (1/1) ... [2025-02-05 17:11:37,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@472024fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:37, skipping insertion in model container [2025-02-05 17:11:37,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:11:37" (1/1) ... [2025-02-05 17:11:37,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:11:38,603 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_label44+token_ring.07.cil-1.c[377340,377353] [2025-02-05 17:11:38,628 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_label44+token_ring.07.cil-1.c[383339,383352] [2025-02-05 17:11:38,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:11:38,794 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:11:39,322 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_label44+token_ring.07.cil-1.c[377340,377353] [2025-02-05 17:11:39,328 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_label44+token_ring.07.cil-1.c[383339,383352] [2025-02-05 17:11:39,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:11:39,386 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:11:39,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39 WrapperNode [2025-02-05 17:11:39,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:11:39,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:11:39,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:11:39,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:11:39,392 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:11:39" (1/1) ... [2025-02-05 17:11:39,481 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:11:39" (1/1) ... [2025-02-05 17:11:39,761 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-02-05 17:11:39,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:11:39,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:11:39,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:11:39,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:11:39,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:39,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:39,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:39,917 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:11:39,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:39,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:40,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:40,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:40,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:40,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:40,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:11:40,247 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:11:40,247 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:11:40,247 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:11:40,248 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (1/1) ... [2025-02-05 17:11:40,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:11:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:11:40,277 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:11:40,281 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:11:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:11:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:11:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:11:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:11:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:11:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:11:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:11:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:11:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:11:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:11:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:11:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:11:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:11:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:11:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:11:40,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:11:40,384 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:11:40,386 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:11:45,894 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:11:45,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:11:45,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:11:45,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:11:45,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:11:45,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:11:45,896 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:11:46,299 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2025-02-05 17:11:46,299 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:11:46,347 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:11:46,348 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:11:46,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:11:46 BoogieIcfgContainer [2025-02-05 17:11:46,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:11:46,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:11:46,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:11:46,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:11:46,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:11:37" (1/3) ... [2025-02-05 17:11:46,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796ecf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:11:46, skipping insertion in model container [2025-02-05 17:11:46,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:11:39" (2/3) ... [2025-02-05 17:11:46,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796ecf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:11:46, skipping insertion in model container [2025-02-05 17:11:46,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:11:46" (3/3) ... [2025-02-05 17:11:46,361 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label44+token_ring.07.cil-1.c [2025-02-05 17:11:46,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:11:46,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label44+token_ring.07.cil-1.c that has 7 procedures, 2456 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-02-05 17:11:46,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:11:46,456 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;@50cd6c2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:11:46,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:11:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 2426 states have (on average 1.8396537510305029) internal successors, (4463), 2429 states have internal predecessors, (4463), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 17:11:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:46,474 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:46,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:46,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:46,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:46,479 INFO L85 PathProgramCache]: Analyzing trace with hash 306970183, now seen corresponding path program 1 times [2025-02-05 17:11:46,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117544965] [2025-02-05 17:11:46,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:46,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:46,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:46,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:46,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:46,932 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:11:46,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:46,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117544965] [2025-02-05 17:11:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117544965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:46,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643791456] [2025-02-05 17:11:46,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:46,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:46,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:46,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:46,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:46,960 INFO L87 Difference]: Start difference. First operand has 2456 states, 2426 states have (on average 1.8396537510305029) internal successors, (4463), 2429 states have internal predecessors, (4463), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:11:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:47,383 INFO L93 Difference]: Finished difference Result 4911 states and 9015 transitions. [2025-02-05 17:11:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:47,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:47,409 INFO L225 Difference]: With dead ends: 4911 [2025-02-05 17:11:47,409 INFO L226 Difference]: Without dead ends: 2405 [2025-02-05 17:11:47,418 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:11:47,421 INFO L435 NwaCegarLoop]: 4332 mSDtfsCounter, 4559 mSDsluCounter, 8559 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 12891 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:47,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 12891 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:11:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2025-02-05 17:11:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2389. [2025-02-05 17:11:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2360 states have (on average 1.8309322033898305) internal successors, (4321), 2362 states have internal predecessors, (4321), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 17:11:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 4363 transitions. [2025-02-05 17:11:47,545 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 4363 transitions. Word has length 123 [2025-02-05 17:11:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:47,546 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 4363 transitions. [2025-02-05 17:11:47,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:11:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 4363 transitions. [2025-02-05 17:11:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:47,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:47,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:47,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:11:47,552 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:47,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:47,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1001617190, now seen corresponding path program 1 times [2025-02-05 17:11:47,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425173356] [2025-02-05 17:11:47,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:47,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:47,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:47,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:47,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:47,799 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:11:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425173356] [2025-02-05 17:11:47,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425173356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:47,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:47,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:47,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690894392] [2025-02-05 17:11:47,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:47,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:47,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:47,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:47,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:47,801 INFO L87 Difference]: Start difference. First operand 2389 states and 4363 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:48,337 INFO L93 Difference]: Finished difference Result 2939 states and 5215 transitions. [2025-02-05 17:11:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:48,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:48,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:48,348 INFO L225 Difference]: With dead ends: 2939 [2025-02-05 17:11:48,348 INFO L226 Difference]: Without dead ends: 2686 [2025-02-05 17:11:48,350 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:11:48,351 INFO L435 NwaCegarLoop]: 4491 mSDtfsCounter, 4692 mSDsluCounter, 13585 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4707 SdHoareTripleChecker+Valid, 18076 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:48,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4707 Valid, 18076 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:11:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-02-05 17:11:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2654. [2025-02-05 17:11:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2599 states have (on average 1.8033859176606386) internal successors, (4687), 2603 states have internal predecessors, (4687), 39 states have call successors, (39), 12 states have call predecessors, (39), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-02-05 17:11:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 4772 transitions. [2025-02-05 17:11:48,414 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 4772 transitions. Word has length 123 [2025-02-05 17:11:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:48,415 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 4772 transitions. [2025-02-05 17:11:48,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:48,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 4772 transitions. [2025-02-05 17:11:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:48,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:48,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:48,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:11:48,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:48,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2132403815, now seen corresponding path program 1 times [2025-02-05 17:11:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:48,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193489411] [2025-02-05 17:11:48,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:48,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:48,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:48,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:48,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:48,576 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:11:48,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:48,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193489411] [2025-02-05 17:11:48,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193489411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:48,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:48,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109285169] [2025-02-05 17:11:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:48,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:48,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:48,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:48,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:48,580 INFO L87 Difference]: Start difference. First operand 2654 states and 4772 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:49,078 INFO L93 Difference]: Finished difference Result 3730 states and 6437 transitions. [2025-02-05 17:11:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:49,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:49,091 INFO L225 Difference]: With dead ends: 3730 [2025-02-05 17:11:49,091 INFO L226 Difference]: Without dead ends: 3214 [2025-02-05 17:11:49,094 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:11:49,095 INFO L435 NwaCegarLoop]: 4455 mSDtfsCounter, 4688 mSDsluCounter, 13509 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4703 SdHoareTripleChecker+Valid, 17964 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:49,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4703 Valid, 17964 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:11:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2025-02-05 17:11:49,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3170. [2025-02-05 17:11:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3067 states have (on average 1.7606781871535702) internal successors, (5400), 3075 states have internal predecessors, (5400), 71 states have call successors, (71), 24 states have call predecessors, (71), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-02-05 17:11:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 5565 transitions. [2025-02-05 17:11:49,186 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 5565 transitions. Word has length 123 [2025-02-05 17:11:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:49,186 INFO L471 AbstractCegarLoop]: Abstraction has 3170 states and 5565 transitions. [2025-02-05 17:11:49,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 5565 transitions. [2025-02-05 17:11:49,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:49,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:49,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:49,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:11:49,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:49,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:49,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1199049478, now seen corresponding path program 1 times [2025-02-05 17:11:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818713347] [2025-02-05 17:11:49,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:49,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:49,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:49,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:49,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:49,353 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:11:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818713347] [2025-02-05 17:11:49,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818713347] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:49,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:49,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:49,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436925490] [2025-02-05 17:11:49,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:49,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:49,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:49,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:49,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:49,356 INFO L87 Difference]: Start difference. First operand 3170 states and 5565 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:49,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:49,858 INFO L93 Difference]: Finished difference Result 5375 states and 9016 transitions. [2025-02-05 17:11:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:49,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:49,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:49,875 INFO L225 Difference]: With dead ends: 5375 [2025-02-05 17:11:49,875 INFO L226 Difference]: Without dead ends: 4343 [2025-02-05 17:11:49,880 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:11:49,880 INFO L435 NwaCegarLoop]: 4452 mSDtfsCounter, 4683 mSDsluCounter, 13496 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 17948 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:49,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 17948 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:11:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2025-02-05 17:11:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 4276. [2025-02-05 17:11:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4071 states have (on average 1.7081798084008843) internal successors, (6954), 4093 states have internal predecessors, (6954), 135 states have call successors, (135), 48 states have call predecessors, (135), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-02-05 17:11:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7303 transitions. [2025-02-05 17:11:49,998 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7303 transitions. Word has length 123 [2025-02-05 17:11:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:49,999 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7303 transitions. [2025-02-05 17:11:49,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7303 transitions. [2025-02-05 17:11:50,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:50,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:50,005 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:50,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:11:50,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:50,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:50,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1602005369, now seen corresponding path program 1 times [2025-02-05 17:11:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759937798] [2025-02-05 17:11:50,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:50,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:50,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:50,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:50,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:50,130 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:11:50,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:50,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759937798] [2025-02-05 17:11:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759937798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:50,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274503516] [2025-02-05 17:11:50,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:50,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:50,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:50,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:50,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:50,132 INFO L87 Difference]: Start difference. First operand 4276 states and 7303 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:50,859 INFO L93 Difference]: Finished difference Result 8942 states and 14770 transitions. [2025-02-05 17:11:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:50,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:50,925 INFO L225 Difference]: With dead ends: 8942 [2025-02-05 17:11:50,925 INFO L226 Difference]: Without dead ends: 6804 [2025-02-05 17:11:50,937 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:11:50,941 INFO L435 NwaCegarLoop]: 4450 mSDtfsCounter, 4678 mSDsluCounter, 13484 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 17934 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:50,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 17934 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:11:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6804 states. [2025-02-05 17:11:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6804 to 6694. [2025-02-05 17:11:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6694 states, 6267 states have (on average 1.6620392532312112) internal successors, (10416), 6335 states have internal predecessors, (10416), 263 states have call successors, (263), 96 states have call predecessors, (263), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-02-05 17:11:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6694 states to 6694 states and 11229 transitions. [2025-02-05 17:11:51,194 INFO L78 Accepts]: Start accepts. Automaton has 6694 states and 11229 transitions. Word has length 123 [2025-02-05 17:11:51,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:51,194 INFO L471 AbstractCegarLoop]: Abstraction has 6694 states and 11229 transitions. [2025-02-05 17:11:51,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:51,195 INFO L276 IsEmpty]: Start isEmpty. Operand 6694 states and 11229 transitions. [2025-02-05 17:11:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:51,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:51,201 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:51,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:11:51,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:51,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1494226662, now seen corresponding path program 1 times [2025-02-05 17:11:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906340610] [2025-02-05 17:11:51,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:51,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:51,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:51,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:51,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:11:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:51,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906340610] [2025-02-05 17:11:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906340610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:51,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553561395] [2025-02-05 17:11:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:51,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:51,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:51,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:51,316 INFO L87 Difference]: Start difference. First operand 6694 states and 11229 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:51,957 INFO L93 Difference]: Finished difference Result 16841 states and 28060 transitions. [2025-02-05 17:11:51,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:52,016 INFO L225 Difference]: With dead ends: 16841 [2025-02-05 17:11:52,016 INFO L226 Difference]: Without dead ends: 12285 [2025-02-05 17:11:52,032 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:11:52,033 INFO L435 NwaCegarLoop]: 4449 mSDtfsCounter, 4673 mSDsluCounter, 13473 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 17922 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:52,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 17922 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:11:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12285 states. [2025-02-05 17:11:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12285 to 12096. [2025-02-05 17:11:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 11171 states have (on average 1.6383492972876197) internal successors, (18302), 11385 states have internal predecessors, (18302), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:11:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20427 transitions. [2025-02-05 17:11:52,525 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20427 transitions. Word has length 123 [2025-02-05 17:11:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:52,527 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20427 transitions. [2025-02-05 17:11:52,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20427 transitions. [2025-02-05 17:11:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:52,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:52,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:52,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:11:52,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:52,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 2009747111, now seen corresponding path program 1 times [2025-02-05 17:11:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760628746] [2025-02-05 17:11:52,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:52,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:52,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:52,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:52,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:52,620 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:11:52,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760628746] [2025-02-05 17:11:52,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760628746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:52,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:52,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:52,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293353766] [2025-02-05 17:11:52,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:52,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:52,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:52,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:52,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:52,623 INFO L87 Difference]: Start difference. First operand 12096 states and 20427 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:11:53,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:53,425 INFO L93 Difference]: Finished difference Result 24486 states and 42155 transitions. [2025-02-05 17:11:53,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:53,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:53,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:53,509 INFO L225 Difference]: With dead ends: 24486 [2025-02-05 17:11:53,510 INFO L226 Difference]: Without dead ends: 14526 [2025-02-05 17:11:53,541 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:11:53,542 INFO L435 NwaCegarLoop]: 4252 mSDtfsCounter, 4484 mSDsluCounter, 8400 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4499 SdHoareTripleChecker+Valid, 12652 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:53,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4499 Valid, 12652 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:11:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14526 states. [2025-02-05 17:11:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14526 to 12096. [2025-02-05 17:11:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 11171 states have (on average 1.6353952197654642) internal successors, (18269), 11385 states have internal predecessors, (18269), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:11:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20394 transitions. [2025-02-05 17:11:53,991 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20394 transitions. Word has length 123 [2025-02-05 17:11:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:53,991 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20394 transitions. [2025-02-05 17:11:53,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:11:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20394 transitions. [2025-02-05 17:11:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:53,998 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:53,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:53,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:11:53,999 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:53,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:54,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1056545478, now seen corresponding path program 1 times [2025-02-05 17:11:54,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:54,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374651582] [2025-02-05 17:11:54,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:54,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:54,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:54,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:54,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:54,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:54,079 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:11:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374651582] [2025-02-05 17:11:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374651582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:54,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600795794] [2025-02-05 17:11:54,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:54,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:54,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:54,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:54,081 INFO L87 Difference]: Start difference. First operand 12096 states and 20394 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:11:54,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:54,553 INFO L93 Difference]: Finished difference Result 24000 states and 41117 transitions. [2025-02-05 17:11:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:54,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:54,600 INFO L225 Difference]: With dead ends: 24000 [2025-02-05 17:11:54,600 INFO L226 Difference]: Without dead ends: 14040 [2025-02-05 17:11:54,626 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:11:54,627 INFO L435 NwaCegarLoop]: 4247 mSDtfsCounter, 4478 mSDsluCounter, 8389 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4493 SdHoareTripleChecker+Valid, 12636 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:54,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4493 Valid, 12636 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:11:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14040 states. [2025-02-05 17:11:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14040 to 12096. [2025-02-05 17:11:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 11171 states have (on average 1.6324411422433085) internal successors, (18236), 11385 states have internal predecessors, (18236), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:11:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20361 transitions. [2025-02-05 17:11:55,211 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20361 transitions. Word has length 123 [2025-02-05 17:11:55,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:55,212 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20361 transitions. [2025-02-05 17:11:55,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:11:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20361 transitions. [2025-02-05 17:11:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:55,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:55,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:55,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:11:55,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:55,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 528179877, now seen corresponding path program 1 times [2025-02-05 17:11:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:55,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590911489] [2025-02-05 17:11:55,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:55,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:55,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:55,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:55,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:55,411 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:11:55,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:55,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590911489] [2025-02-05 17:11:55,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590911489] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:55,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:55,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:55,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204777914] [2025-02-05 17:11:55,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:55,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:55,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:55,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:55,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:55,413 INFO L87 Difference]: Start difference. First operand 12096 states and 20361 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:56,354 INFO L93 Difference]: Finished difference Result 35183 states and 60205 transitions. [2025-02-05 17:11:56,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:56,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:56,440 INFO L225 Difference]: With dead ends: 35183 [2025-02-05 17:11:56,441 INFO L226 Difference]: Without dead ends: 25225 [2025-02-05 17:11:56,465 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:11:56,467 INFO L435 NwaCegarLoop]: 4435 mSDtfsCounter, 4814 mSDsluCounter, 13406 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4837 SdHoareTripleChecker+Valid, 17841 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:56,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4837 Valid, 17841 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:11:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25225 states. [2025-02-05 17:11:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25225 to 23616. [2025-02-05 17:11:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 21565 states have (on average 1.6230929747275677) internal successors, (35002), 22233 states have internal predecessors, (35002), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:11:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 41223 transitions. [2025-02-05 17:11:57,710 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 41223 transitions. Word has length 123 [2025-02-05 17:11:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:57,711 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 41223 transitions. [2025-02-05 17:11:57,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:11:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 41223 transitions. [2025-02-05 17:11:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:11:57,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:57,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:57,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:11:57,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:57,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:57,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1203872486, now seen corresponding path program 1 times [2025-02-05 17:11:57,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:57,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237321237] [2025-02-05 17:11:57,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:57,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:57,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:11:57,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:11:57,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:57,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:57,802 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:11:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237321237] [2025-02-05 17:11:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237321237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:57,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149692257] [2025-02-05 17:11:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:57,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:57,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:57,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:57,803 INFO L87 Difference]: Start difference. First operand 23616 states and 41223 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:11:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:58,867 INFO L93 Difference]: Finished difference Result 49470 states and 89377 transitions. [2025-02-05 17:11:58,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:58,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:11:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:59,059 INFO L225 Difference]: With dead ends: 49470 [2025-02-05 17:11:59,059 INFO L226 Difference]: Without dead ends: 27990 [2025-02-05 17:11:59,102 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:11:59,102 INFO L435 NwaCegarLoop]: 4242 mSDtfsCounter, 4474 mSDsluCounter, 8380 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4489 SdHoareTripleChecker+Valid, 12622 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:59,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4489 Valid, 12622 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:11:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27990 states. [2025-02-05 17:12:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27990 to 23616. [2025-02-05 17:12:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 21565 states have (on average 1.6200788314398331) internal successors, (34937), 22233 states have internal predecessors, (34937), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:12:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 41158 transitions. [2025-02-05 17:12:00,414 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 41158 transitions. Word has length 123 [2025-02-05 17:12:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:00,414 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 41158 transitions. [2025-02-05 17:12:00,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:12:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 41158 transitions. [2025-02-05 17:12:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:12:00,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:00,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:12:00,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:12:00,426 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:00,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 394385029, now seen corresponding path program 1 times [2025-02-05 17:12:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:00,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190210112] [2025-02-05 17:12:00,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:00,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:00,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:12:00,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:12:00,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:00,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:00,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:00,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190210112] [2025-02-05 17:12:00,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190210112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:00,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:00,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007028907] [2025-02-05 17:12:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:00,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:00,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:00,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:00,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:00,525 INFO L87 Difference]: Start difference. First operand 23616 states and 41158 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:12:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:01,856 INFO L93 Difference]: Finished difference Result 48741 states and 87789 transitions. [2025-02-05 17:12:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:12:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:01,957 INFO L225 Difference]: With dead ends: 48741 [2025-02-05 17:12:01,957 INFO L226 Difference]: Without dead ends: 27261 [2025-02-05 17:12:01,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:02,000 INFO L435 NwaCegarLoop]: 4239 mSDtfsCounter, 4471 mSDsluCounter, 8375 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4486 SdHoareTripleChecker+Valid, 12614 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:02,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4486 Valid, 12614 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:12:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27261 states. [2025-02-05 17:12:03,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27261 to 23616. [2025-02-05 17:12:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 21565 states have (on average 1.6170646881520983) internal successors, (34872), 22233 states have internal predecessors, (34872), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:12:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 41093 transitions. [2025-02-05 17:12:03,424 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 41093 transitions. Word has length 123 [2025-02-05 17:12:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:03,425 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 41093 transitions. [2025-02-05 17:12:03,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:12:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 41093 transitions. [2025-02-05 17:12:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:12:03,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:03,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:12:03,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:12:03,445 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:03,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash -47369466, now seen corresponding path program 1 times [2025-02-05 17:12:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318327698] [2025-02-05 17:12:03,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:03,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:03,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:12:03,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:12:03,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:03,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:03,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:03,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318327698] [2025-02-05 17:12:03,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318327698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:03,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:03,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:03,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497085654] [2025-02-05 17:12:03,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:03,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:03,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:03,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:03,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:03,579 INFO L87 Difference]: Start difference. First operand 23616 states and 41093 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:12:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:05,563 INFO L93 Difference]: Finished difference Result 70918 states and 129599 transitions. [2025-02-05 17:12:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:05,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:12:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:05,753 INFO L225 Difference]: With dead ends: 70918 [2025-02-05 17:12:05,754 INFO L226 Difference]: Without dead ends: 49440 [2025-02-05 17:12:05,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:12:05,902 INFO L435 NwaCegarLoop]: 4421 mSDtfsCounter, 4703 mSDsluCounter, 13351 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4726 SdHoareTripleChecker+Valid, 17772 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:05,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4726 Valid, 17772 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:12:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49440 states. [2025-02-05 17:12:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49440 to 47770. [2025-02-05 17:12:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47770 states, 43013 states have (on average 1.6074675098226117) internal successors, (69142), 45075 states have internal predecessors, (69142), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-02-05 17:12:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47770 states to 47770 states and 89635 transitions. [2025-02-05 17:12:08,032 INFO L78 Accepts]: Start accepts. Automaton has 47770 states and 89635 transitions. Word has length 123 [2025-02-05 17:12:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:08,034 INFO L471 AbstractCegarLoop]: Abstraction has 47770 states and 89635 transitions. [2025-02-05 17:12:08,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:12:08,034 INFO L276 IsEmpty]: Start isEmpty. Operand 47770 states and 89635 transitions. [2025-02-05 17:12:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:12:08,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:08,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:12:08,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:12:08,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:08,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash -61619611, now seen corresponding path program 1 times [2025-02-05 17:12:08,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:08,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506364968] [2025-02-05 17:12:08,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:08,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:12:08,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:12:08,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:08,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:08,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506364968] [2025-02-05 17:12:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506364968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:08,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:08,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065399258] [2025-02-05 17:12:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:08,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:08,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:08,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:08,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:08,202 INFO L87 Difference]: Start difference. First operand 47770 states and 89635 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:12:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:11,417 INFO L93 Difference]: Finished difference Result 99965 states and 198745 transitions. [2025-02-05 17:12:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:12:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:11,655 INFO L225 Difference]: With dead ends: 99965 [2025-02-05 17:12:11,655 INFO L226 Difference]: Without dead ends: 54331 [2025-02-05 17:12:11,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:11,752 INFO L435 NwaCegarLoop]: 4234 mSDtfsCounter, 4467 mSDsluCounter, 8366 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 12600 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:11,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 12600 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:12:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54331 states. [2025-02-05 17:12:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54331 to 47770. [2025-02-05 17:12:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47770 states, 43013 states have (on average 1.6044684165252365) internal successors, (69013), 45075 states have internal predecessors, (69013), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-02-05 17:12:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47770 states to 47770 states and 89506 transitions. [2025-02-05 17:12:15,759 INFO L78 Accepts]: Start accepts. Automaton has 47770 states and 89506 transitions. Word has length 123 [2025-02-05 17:12:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:15,759 INFO L471 AbstractCegarLoop]: Abstraction has 47770 states and 89506 transitions. [2025-02-05 17:12:15,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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:12:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 47770 states and 89506 transitions. [2025-02-05 17:12:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:12:15,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:15,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:12:15,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:12:15,776 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:15,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1031910618, now seen corresponding path program 1 times [2025-02-05 17:12:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978256896] [2025-02-05 17:12:15,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:15,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:12:15,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:12:15,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:15,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:15,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978256896] [2025-02-05 17:12:15,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978256896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:15,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:15,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:15,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625083233] [2025-02-05 17:12:15,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:15,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:15,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:15,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:15,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:15,854 INFO L87 Difference]: Start difference. First operand 47770 states and 89506 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:12:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:21,267 INFO L93 Difference]: Finished difference Result 144256 states and 297337 transitions. [2025-02-05 17:12:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:21,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:12:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:21,825 INFO L225 Difference]: With dead ends: 144256 [2025-02-05 17:12:21,826 INFO L226 Difference]: Without dead ends: 98624 [2025-02-05 17:12:21,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:12:21,921 INFO L435 NwaCegarLoop]: 4414 mSDtfsCounter, 4630 mSDsluCounter, 13320 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4653 SdHoareTripleChecker+Valid, 17734 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:21,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4653 Valid, 17734 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:12:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98624 states. [2025-02-05 17:12:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98624 to 97340. [2025-02-05 17:12:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97340 states, 85777 states have (on average 1.5827902584608928) internal successors, (135767), 92085 states have internal predecessors, (135767), 3719 states have call successors, (3719), 1536 states have call predecessors, (3719), 7842 states have return successors, (69766), 3974 states have call predecessors, (69766), 3719 states have call successors, (69766) [2025-02-05 17:12:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97340 states to 97340 states and 209252 transitions. [2025-02-05 17:12:30,155 INFO L78 Accepts]: Start accepts. Automaton has 97340 states and 209252 transitions. Word has length 123 [2025-02-05 17:12:30,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:30,156 INFO L471 AbstractCegarLoop]: Abstraction has 97340 states and 209252 transitions. [2025-02-05 17:12:30,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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:12:30,156 INFO L276 IsEmpty]: Start isEmpty. Operand 97340 states and 209252 transitions. [2025-02-05 17:12:30,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:12:30,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:30,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:12:30,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:12:30,191 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:30,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:30,191 INFO L85 PathProgramCache]: Analyzing trace with hash -93379003, now seen corresponding path program 1 times [2025-02-05 17:12:30,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:30,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509589974] [2025-02-05 17:12:30,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:30,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:12:30,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:12:30,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:30,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:12:30,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:30,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509589974] [2025-02-05 17:12:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509589974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:30,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:30,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:12:30,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262359470] [2025-02-05 17:12:30,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:30,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:12:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:30,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:12:30,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:12:30,244 INFO L87 Difference]: Start difference. First operand 97340 states and 209252 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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)