./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.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/pc_sfifo_1.cil-2+token_ring.02.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 c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:52:40,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:52:40,239 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:52:40,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:52:40,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:52:40,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:52:40,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:52:40,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:52:40,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:52:40,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:52:40,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:52:40,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:52:40,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:52:40,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:52:40,262 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:52:40,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:52:40,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:52:40,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:52:40,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:52:40,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:52:40,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:52:40,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:52:40,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:52:40,264 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 -> c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 [2025-02-05 17:52:40,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:52:40,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:52:40,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:52:40,642 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:52:40,642 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:52:40,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2025-02-05 17:52:41,810 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b31708d6/e8439f2048724561bcc0d3ccab6104ec/FLAG5a342f9f9 [2025-02-05 17:52:42,103 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:52:42,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2025-02-05 17:52:42,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b31708d6/e8439f2048724561bcc0d3ccab6104ec/FLAG5a342f9f9 [2025-02-05 17:52:42,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2b31708d6/e8439f2048724561bcc0d3ccab6104ec [2025-02-05 17:52:42,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:52:42,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:52:42,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:52:42,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:52:42,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:52:42,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730e2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42, skipping insertion in model container [2025-02-05 17:52:42,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:52:42,268 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/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2025-02-05 17:52:42,293 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/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2025-02-05 17:52:42,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:52:42,319 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:52:42,325 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/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2025-02-05 17:52:42,335 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/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2025-02-05 17:52:42,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:52:42,360 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:52:42,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42 WrapperNode [2025-02-05 17:52:42,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:52:42,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:52:42,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:52:42,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:52:42,365 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:52:42" (1/1) ... [2025-02-05 17:52:42,371 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:52:42" (1/1) ... [2025-02-05 17:52:42,386 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 456 [2025-02-05 17:52:42,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:52:42,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:52:42,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:52:42,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:52:42,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,402 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:52:42,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:52:42,410 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:52:42,410 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:52:42,410 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:52:42,411 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (1/1) ... [2025-02-05 17:52:42,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:52:42,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:52:42,437 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:52:42,446 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:52:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:52:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:52:42,462 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:52:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-02-05 17:52:42,463 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-02-05 17:52:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:52:42,463 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:52:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:52:42,463 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:52:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:52:42,463 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:52:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:52:42,463 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:52:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:52:42,463 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:52:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:52:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:52:42,464 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:52:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:52:42,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:52:42,464 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:52:42,464 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:52:42,519 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:52:42,520 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:52:42,843 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-02-05 17:52:42,843 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:52:42,857 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:52:42,864 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:52:42,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:52:42 BoogieIcfgContainer [2025-02-05 17:52:42,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:52:42,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:52:42,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:52:42,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:52:42,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:52:42" (1/3) ... [2025-02-05 17:52:42,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a59e76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:52:42, skipping insertion in model container [2025-02-05 17:52:42,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:42" (2/3) ... [2025-02-05 17:52:42,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a59e76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:52:42, skipping insertion in model container [2025-02-05 17:52:42,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:52:42" (3/3) ... [2025-02-05 17:52:42,873 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2025-02-05 17:52:42,883 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:52:42,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c that has 10 procedures, 212 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-02-05 17:52:42,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:52:42,941 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;@39f1119e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:52:42,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:52:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 178 states have (on average 1.4887640449438202) internal successors, (265), 184 states have internal predecessors, (265), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 17:52:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:52:42,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:42,953 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] [2025-02-05 17:52:42,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:42,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -824378389, now seen corresponding path program 1 times [2025-02-05 17:52:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:42,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520418264] [2025-02-05 17:52:42,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:42,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:43,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:52:43,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:52:43,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:43,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:43,180 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:52:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:43,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520418264] [2025-02-05 17:52:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520418264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:43,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:43,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:43,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126840432] [2025-02-05 17:52:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:43,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:43,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:43,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,207 INFO L87 Difference]: Start difference. First operand has 213 states, 178 states have (on average 1.4887640449438202) internal successors, (265), 184 states have internal predecessors, (265), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 17:52:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:43,263 INFO L93 Difference]: Finished difference Result 410 states and 592 transitions. [2025-02-05 17:52:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:43,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-02-05 17:52:43,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:43,271 INFO L225 Difference]: With dead ends: 410 [2025-02-05 17:52:43,273 INFO L226 Difference]: Without dead ends: 202 [2025-02-05 17:52:43,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,280 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 95 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:43,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 488 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-05 17:52:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-05 17:52:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.423529411764706) internal successors, (242), 173 states have internal predecessors, (242), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 17:52:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 284 transitions. [2025-02-05 17:52:43,331 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 284 transitions. Word has length 44 [2025-02-05 17:52:43,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:43,331 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 284 transitions. [2025-02-05 17:52:43,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 17:52:43,331 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 284 transitions. [2025-02-05 17:52:43,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:52:43,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:43,337 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] [2025-02-05 17:52:43,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:52:43,337 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:43,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:43,338 INFO L85 PathProgramCache]: Analyzing trace with hash 98305194, now seen corresponding path program 1 times [2025-02-05 17:52:43,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:43,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450355231] [2025-02-05 17:52:43,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:43,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:52:43,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:52:43,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:43,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:43,410 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:52:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450355231] [2025-02-05 17:52:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450355231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094789087] [2025-02-05 17:52:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:43,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:43,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:43,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:43,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,417 INFO L87 Difference]: Start difference. First operand 202 states and 284 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:43,469 INFO L93 Difference]: Finished difference Result 324 states and 451 transitions. [2025-02-05 17:52:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:43,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-02-05 17:52:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:43,472 INFO L225 Difference]: With dead ends: 324 [2025-02-05 17:52:43,472 INFO L226 Difference]: Without dead ends: 260 [2025-02-05 17:52:43,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,473 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 261 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:43,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 375 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-05 17:52:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2025-02-05 17:52:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 216 states have (on average 1.4027777777777777) internal successors, (303), 219 states have internal predecessors, (303), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (27), 23 states have call predecessors, (27), 23 states have call successors, (27) [2025-02-05 17:52:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 355 transitions. [2025-02-05 17:52:43,508 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 355 transitions. Word has length 44 [2025-02-05 17:52:43,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:43,508 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 355 transitions. [2025-02-05 17:52:43,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 355 transitions. [2025-02-05 17:52:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 17:52:43,509 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:43,509 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] [2025-02-05 17:52:43,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:52:43,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:43,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1508474249, now seen corresponding path program 1 times [2025-02-05 17:52:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:43,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269303779] [2025-02-05 17:52:43,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:43,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 17:52:43,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 17:52:43,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:43,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:43,570 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:52:43,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:43,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269303779] [2025-02-05 17:52:43,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269303779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:43,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:43,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:43,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485091295] [2025-02-05 17:52:43,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:43,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:43,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:43,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:43,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,572 INFO L87 Difference]: Start difference. First operand 253 states and 355 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:43,606 INFO L93 Difference]: Finished difference Result 471 states and 658 transitions. [2025-02-05 17:52:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:43,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-02-05 17:52:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:43,609 INFO L225 Difference]: With dead ends: 471 [2025-02-05 17:52:43,609 INFO L226 Difference]: Without dead ends: 358 [2025-02-05 17:52:43,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,614 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 259 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:43,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 361 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:43,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-05 17:52:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 354. [2025-02-05 17:52:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 306 states have (on average 1.3758169934640523) internal successors, (421), 309 states have internal predecessors, (421), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (38), 30 states have call predecessors, (38), 30 states have call successors, (38) [2025-02-05 17:52:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 491 transitions. [2025-02-05 17:52:43,649 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 491 transitions. Word has length 45 [2025-02-05 17:52:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:43,649 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 491 transitions. [2025-02-05 17:52:43,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 491 transitions. [2025-02-05 17:52:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 17:52:43,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:43,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:52:43,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:52:43,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:43,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1787491004, now seen corresponding path program 1 times [2025-02-05 17:52:43,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:43,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779085541] [2025-02-05 17:52:43,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:43,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:43,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 17:52:43,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 17:52:43,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:43,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:43,713 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:52:43,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:43,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779085541] [2025-02-05 17:52:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779085541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:43,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:43,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034377837] [2025-02-05 17:52:43,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:43,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:43,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:43,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,715 INFO L87 Difference]: Start difference. First operand 354 states and 491 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:43,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:43,761 INFO L93 Difference]: Finished difference Result 738 states and 1006 transitions. [2025-02-05 17:52:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:43,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2025-02-05 17:52:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:43,765 INFO L225 Difference]: With dead ends: 738 [2025-02-05 17:52:43,767 INFO L226 Difference]: Without dead ends: 518 [2025-02-05 17:52:43,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,773 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 66 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:43,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 572 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-05 17:52:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 483. [2025-02-05 17:52:43,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 421 states have (on average 1.3539192399049882) internal successors, (570), 426 states have internal predecessors, (570), 40 states have call successors, (40), 21 states have call predecessors, (40), 20 states have return successors, (48), 36 states have call predecessors, (48), 38 states have call successors, (48) [2025-02-05 17:52:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 658 transitions. [2025-02-05 17:52:43,827 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 658 transitions. Word has length 46 [2025-02-05 17:52:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:43,827 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 658 transitions. [2025-02-05 17:52:43,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 658 transitions. [2025-02-05 17:52:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 17:52:43,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:43,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:52:43,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:52:43,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:43,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash 605918576, now seen corresponding path program 1 times [2025-02-05 17:52:43,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:43,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907687080] [2025-02-05 17:52:43,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:43,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:43,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:52:43,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:52:43,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:43,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 17:52:43,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:43,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907687080] [2025-02-05 17:52:43,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907687080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:43,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:43,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:43,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609291437] [2025-02-05 17:52:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:43,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:43,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:43,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:43,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,927 INFO L87 Difference]: Start difference. First operand 483 states and 658 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 17:52:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:43,973 INFO L93 Difference]: Finished difference Result 769 states and 1042 transitions. [2025-02-05 17:52:43,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:43,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-02-05 17:52:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:43,980 INFO L225 Difference]: With dead ends: 769 [2025-02-05 17:52:43,980 INFO L226 Difference]: Without dead ends: 544 [2025-02-05 17:52:43,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:43,982 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 54 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:43,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 616 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-05 17:52:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-02-05 17:52:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 474 states have (on average 1.3270042194092826) internal successors, (629), 479 states have internal predecessors, (629), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (56), 41 states have call predecessors, (56), 43 states have call successors, (56) [2025-02-05 17:52:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 730 transitions. [2025-02-05 17:52:44,015 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 730 transitions. Word has length 63 [2025-02-05 17:52:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:44,015 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 730 transitions. [2025-02-05 17:52:44,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 17:52:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 730 transitions. [2025-02-05 17:52:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:52:44,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:44,017 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] [2025-02-05 17:52:44,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:52:44,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:44,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1930894202, now seen corresponding path program 1 times [2025-02-05 17:52:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:44,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302418276] [2025-02-05 17:52:44,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:44,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:52:44,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:52:44,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:44,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:44,123 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:52:44,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:44,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302418276] [2025-02-05 17:52:44,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302418276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:44,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:44,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:52:44,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007015826] [2025-02-05 17:52:44,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:44,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:52:44,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:44,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:52:44,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:52:44,125 INFO L87 Difference]: Start difference. First operand 544 states and 730 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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:52:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:44,580 INFO L93 Difference]: Finished difference Result 798 states and 1100 transitions. [2025-02-05 17:52:44,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:52:44,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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 68 [2025-02-05 17:52:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:44,583 INFO L225 Difference]: With dead ends: 798 [2025-02-05 17:52:44,583 INFO L226 Difference]: Without dead ends: 675 [2025-02-05 17:52:44,584 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:52:44,587 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 425 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:44,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 674 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:52:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-02-05 17:52:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 666. [2025-02-05 17:52:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 578 states have (on average 1.3512110726643598) internal successors, (781), 584 states have internal predecessors, (781), 56 states have call successors, (56), 30 states have call predecessors, (56), 30 states have return successors, (68), 52 states have call predecessors, (68), 54 states have call successors, (68) [2025-02-05 17:52:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 905 transitions. [2025-02-05 17:52:44,615 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 905 transitions. Word has length 68 [2025-02-05 17:52:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:44,615 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 905 transitions. [2025-02-05 17:52:44,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 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:52:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 905 transitions. [2025-02-05 17:52:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:52:44,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:44,616 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] [2025-02-05 17:52:44,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:52:44,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:44,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash 547077564, now seen corresponding path program 1 times [2025-02-05 17:52:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:44,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227362365] [2025-02-05 17:52:44,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:44,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:52:44,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:52:44,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:44,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:44,689 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:52:44,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227362365] [2025-02-05 17:52:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227362365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:44,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:44,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:52:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001777184] [2025-02-05 17:52:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:44,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:52:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:44,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:52:44,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:44,690 INFO L87 Difference]: Start difference. First operand 666 states and 905 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:52:45,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:45,175 INFO L93 Difference]: Finished difference Result 1059 states and 1475 transitions. [2025-02-05 17:52:45,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:52:45,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-02-05 17:52:45,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:45,180 INFO L225 Difference]: With dead ends: 1059 [2025-02-05 17:52:45,180 INFO L226 Difference]: Without dead ends: 814 [2025-02-05 17:52:45,181 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:52:45,182 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 415 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:45,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1158 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:52:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2025-02-05 17:52:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 781. [2025-02-05 17:52:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 675 states have (on average 1.3614814814814815) internal successors, (919), 682 states have internal predecessors, (919), 67 states have call successors, (67), 36 states have call predecessors, (67), 37 states have return successors, (82), 64 states have call predecessors, (82), 65 states have call successors, (82) [2025-02-05 17:52:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1068 transitions. [2025-02-05 17:52:45,237 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1068 transitions. Word has length 68 [2025-02-05 17:52:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:45,237 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1068 transitions. [2025-02-05 17:52:45,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:52:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1068 transitions. [2025-02-05 17:52:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:52:45,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:45,240 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] [2025-02-05 17:52:45,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:52:45,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:45,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 985087067, now seen corresponding path program 1 times [2025-02-05 17:52:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:45,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889124431] [2025-02-05 17:52:45,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:45,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:52:45,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:52:45,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:45,358 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:52:45,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:45,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889124431] [2025-02-05 17:52:45,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889124431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:45,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:45,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:52:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35964279] [2025-02-05 17:52:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:45,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:52:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:45,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:52:45,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:45,360 INFO L87 Difference]: Start difference. First operand 781 states and 1068 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:52:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:45,869 INFO L93 Difference]: Finished difference Result 1414 states and 1983 transitions. [2025-02-05 17:52:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:52:45,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-02-05 17:52:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:45,875 INFO L225 Difference]: With dead ends: 1414 [2025-02-05 17:52:45,875 INFO L226 Difference]: Without dead ends: 1054 [2025-02-05 17:52:45,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:52:45,877 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 410 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:45,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 1142 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:52:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2025-02-05 17:52:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1020. [2025-02-05 17:52:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 876 states have (on average 1.3767123287671232) internal successors, (1206), 887 states have internal predecessors, (1206), 89 states have call successors, (89), 48 states have call predecessors, (89), 53 states have return successors, (116), 88 states have call predecessors, (116), 87 states have call successors, (116) [2025-02-05 17:52:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1411 transitions. [2025-02-05 17:52:45,971 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1411 transitions. Word has length 68 [2025-02-05 17:52:45,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:45,972 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1411 transitions. [2025-02-05 17:52:45,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:52:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1411 transitions. [2025-02-05 17:52:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:52:45,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:45,973 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] [2025-02-05 17:52:45,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:52:45,973 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:45,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash -940446244, now seen corresponding path program 1 times [2025-02-05 17:52:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:45,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332663648] [2025-02-05 17:52:45,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:45,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:45,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:52:45,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:52:45,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:45,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:46,085 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:52:46,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:46,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332663648] [2025-02-05 17:52:46,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332663648] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:46,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:46,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:52:46,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933377973] [2025-02-05 17:52:46,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:46,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:52:46,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:46,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:52:46,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:46,088 INFO L87 Difference]: Start difference. First operand 1020 states and 1411 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:52:46,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:46,517 INFO L93 Difference]: Finished difference Result 2183 states and 3097 transitions. [2025-02-05 17:52:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:52:46,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-02-05 17:52:46,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:46,523 INFO L225 Difference]: With dead ends: 2183 [2025-02-05 17:52:46,523 INFO L226 Difference]: Without dead ends: 1584 [2025-02-05 17:52:46,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:52:46,525 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 445 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:46,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1099 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:52:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-02-05 17:52:46,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1474. [2025-02-05 17:52:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1252 states have (on average 1.389776357827476) internal successors, (1740), 1277 states have internal predecessors, (1740), 129 states have call successors, (129), 72 states have call predecessors, (129), 91 states have return successors, (204), 132 states have call predecessors, (204), 127 states have call successors, (204) [2025-02-05 17:52:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2073 transitions. [2025-02-05 17:52:46,617 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2073 transitions. Word has length 68 [2025-02-05 17:52:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:46,617 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 2073 transitions. [2025-02-05 17:52:46,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:52:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2073 transitions. [2025-02-05 17:52:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:52:46,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:46,618 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] [2025-02-05 17:52:46,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:52:46,619 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:46,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash 192744349, now seen corresponding path program 1 times [2025-02-05 17:52:46,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:46,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001669810] [2025-02-05 17:52:46,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:46,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:52:46,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:52:46,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:46,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:46,722 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:52:46,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:46,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001669810] [2025-02-05 17:52:46,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001669810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:46,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:46,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:52:46,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048826271] [2025-02-05 17:52:46,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:46,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:52:46,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:46,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:52:46,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:46,727 INFO L87 Difference]: Start difference. First operand 1474 states and 2073 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:52:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:47,197 INFO L93 Difference]: Finished difference Result 3569 states and 5165 transitions. [2025-02-05 17:52:47,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:52:47,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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 68 [2025-02-05 17:52:47,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:47,207 INFO L225 Difference]: With dead ends: 3569 [2025-02-05 17:52:47,207 INFO L226 Difference]: Without dead ends: 2516 [2025-02-05 17:52:47,209 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:52:47,209 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 411 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:47,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1091 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:52:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2025-02-05 17:52:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2421. [2025-02-05 17:52:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2029 states have (on average 1.3957614588467224) internal successors, (2832), 2100 states have internal predecessors, (2832), 205 states have call successors, (205), 120 states have call predecessors, (205), 185 states have return successors, (472), 216 states have call predecessors, (472), 203 states have call successors, (472) [2025-02-05 17:52:47,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 3509 transitions. [2025-02-05 17:52:47,362 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 3509 transitions. Word has length 68 [2025-02-05 17:52:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:47,362 INFO L471 AbstractCegarLoop]: Abstraction has 2421 states and 3509 transitions. [2025-02-05 17:52:47,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 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:52:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 3509 transitions. [2025-02-05 17:52:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:52:47,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:47,365 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] [2025-02-05 17:52:47,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:52:47,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:47,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash -47795780, now seen corresponding path program 1 times [2025-02-05 17:52:47,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:47,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552946614] [2025-02-05 17:52:47,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:47,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:47,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:52:47,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:52:47,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:47,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:47,404 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:52:47,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552946614] [2025-02-05 17:52:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552946614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:47,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:47,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:52:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570397882] [2025-02-05 17:52:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:47,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:52:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:47,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:52:47,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:52:47,405 INFO L87 Difference]: Start difference. First operand 2421 states and 3509 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:47,665 INFO L93 Difference]: Finished difference Result 5503 states and 8139 transitions. [2025-02-05 17:52:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:52:47,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2025-02-05 17:52:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:47,679 INFO L225 Difference]: With dead ends: 5503 [2025-02-05 17:52:47,679 INFO L226 Difference]: Without dead ends: 3504 [2025-02-05 17:52:47,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:52:47,684 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 411 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:47,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 805 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:52:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2025-02-05 17:52:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 3423. [2025-02-05 17:52:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 2861 states have (on average 1.3834323663054875) internal successors, (3958), 2961 states have internal predecessors, (3958), 301 states have call successors, (301), 174 states have call predecessors, (301), 259 states have return successors, (625), 303 states have call predecessors, (625), 299 states have call successors, (625) [2025-02-05 17:52:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 4884 transitions. [2025-02-05 17:52:47,856 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 4884 transitions. Word has length 68 [2025-02-05 17:52:47,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:47,856 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 4884 transitions. [2025-02-05 17:52:47,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 4884 transitions. [2025-02-05 17:52:47,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:52:47,859 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:47,859 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:52:47,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:52:47,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:47,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1180939628, now seen corresponding path program 1 times [2025-02-05 17:52:47,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:47,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142318222] [2025-02-05 17:52:47,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:47,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:47,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:52:47,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:52:47,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:47,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 17:52:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142318222] [2025-02-05 17:52:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142318222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:47,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:47,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:47,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972860602] [2025-02-05 17:52:47,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:47,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:47,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:47,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:47,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:47,894 INFO L87 Difference]: Start difference. First operand 3423 states and 4884 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 17:52:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:47,969 INFO L93 Difference]: Finished difference Result 3472 states and 4944 transitions. [2025-02-05 17:52:47,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:47,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2025-02-05 17:52:47,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:47,980 INFO L225 Difference]: With dead ends: 3472 [2025-02-05 17:52:47,980 INFO L226 Difference]: Without dead ends: 3013 [2025-02-05 17:52:47,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:47,982 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 220 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:47,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 234 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2025-02-05 17:52:48,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3013. [2025-02-05 17:52:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 2498 states have (on average 1.3967173738991192) internal successors, (3489), 2594 states have internal predecessors, (3489), 272 states have call successors, (272), 156 states have call predecessors, (272), 242 states have return successors, (585), 278 states have call predecessors, (585), 272 states have call successors, (585) [2025-02-05 17:52:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 4346 transitions. [2025-02-05 17:52:48,116 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 4346 transitions. Word has length 68 [2025-02-05 17:52:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:48,117 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 4346 transitions. [2025-02-05 17:52:48,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 17:52:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 4346 transitions. [2025-02-05 17:52:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:52:48,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:48,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:48,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:52:48,122 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:48,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash -923451970, now seen corresponding path program 1 times [2025-02-05 17:52:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:48,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102633833] [2025-02-05 17:52:48,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:48,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:52:48,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:52:48,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:48,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:52:48,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102633833] [2025-02-05 17:52:48,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102633833] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:52:48,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8414318] [2025-02-05 17:52:48,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:48,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:52:48,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:52:48,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:52:48,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:52:48,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:52:48,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:52:48,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:48,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:48,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:52:48,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:52:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 17:52:48,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:52:48,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8414318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:48,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:52:48,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:52:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206619344] [2025-02-05 17:52:48,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:48,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:48,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:48,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:48,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:48,432 INFO L87 Difference]: Start difference. First operand 3013 states and 4346 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:52:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:48,837 INFO L93 Difference]: Finished difference Result 8872 states and 12874 transitions. [2025-02-05 17:52:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:48,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2025-02-05 17:52:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:48,857 INFO L225 Difference]: With dead ends: 8872 [2025-02-05 17:52:48,857 INFO L226 Difference]: Without dead ends: 5871 [2025-02-05 17:52:48,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:48,862 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 146 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:48,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 351 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2025-02-05 17:52:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5791. [2025-02-05 17:52:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 4800 states have (on average 1.3960416666666666) internal successors, (6701), 4991 states have internal predecessors, (6701), 510 states have call successors, (510), 308 states have call predecessors, (510), 480 states have return successors, (1121), 507 states have call predecessors, (1121), 510 states have call successors, (1121) [2025-02-05 17:52:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 8332 transitions. [2025-02-05 17:52:49,186 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 8332 transitions. Word has length 112 [2025-02-05 17:52:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:49,186 INFO L471 AbstractCegarLoop]: Abstraction has 5791 states and 8332 transitions. [2025-02-05 17:52:49,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:52:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 8332 transitions. [2025-02-05 17:52:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:52:49,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:49,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:52:49,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 17:52:49,396 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:49,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1924974780, now seen corresponding path program 1 times [2025-02-05 17:52:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361037147] [2025-02-05 17:52:49,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:49,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:52:49,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:52:49,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:49,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:52:49,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361037147] [2025-02-05 17:52:49,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361037147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:52:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359131576] [2025-02-05 17:52:49,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:49,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:52:49,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:52:49,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:52:49,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:52:49,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:52:49,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:52:49,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:49,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:49,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:52:49,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:52:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 17:52:49,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:52:49,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359131576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:49,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:52:49,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:52:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800526370] [2025-02-05 17:52:49,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:49,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:49,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:49,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:49,591 INFO L87 Difference]: Start difference. First operand 5791 states and 8332 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:52:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:50,019 INFO L93 Difference]: Finished difference Result 17148 states and 24826 transitions. [2025-02-05 17:52:50,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:50,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 112 [2025-02-05 17:52:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:50,062 INFO L225 Difference]: With dead ends: 17148 [2025-02-05 17:52:50,062 INFO L226 Difference]: Without dead ends: 11369 [2025-02-05 17:52:50,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:50,077 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 152 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:50,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 351 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11369 states. [2025-02-05 17:52:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11369 to 11211. [2025-02-05 17:52:50,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11211 states, 9270 states have (on average 1.3929881337648329) internal successors, (12913), 9651 states have internal predecessors, (12913), 984 states have call successors, (984), 612 states have call predecessors, (984), 956 states have return successors, (2191), 963 states have call predecessors, (2191), 984 states have call successors, (2191) [2025-02-05 17:52:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11211 states to 11211 states and 16088 transitions. [2025-02-05 17:52:50,650 INFO L78 Accepts]: Start accepts. Automaton has 11211 states and 16088 transitions. Word has length 112 [2025-02-05 17:52:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:50,650 INFO L471 AbstractCegarLoop]: Abstraction has 11211 states and 16088 transitions. [2025-02-05 17:52:50,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:52:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 11211 states and 16088 transitions. [2025-02-05 17:52:50,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 17:52:50,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:50,661 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:50,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 17:52:50,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:52:50,862 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1007324086, now seen corresponding path program 1 times [2025-02-05 17:52:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:50,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718732343] [2025-02-05 17:52:50,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:50,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:50,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:52:50,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:52:50,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:50,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:52:50,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:50,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718732343] [2025-02-05 17:52:50,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718732343] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:52:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344582754] [2025-02-05 17:52:50,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:50,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:52:50,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:52:50,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:52:50,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:52:50,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 17:52:50,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 17:52:50,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:50,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:50,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:52:50,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:52:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 17:52:51,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:52:51,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344582754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:51,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:52:51,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:52:51,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851529443] [2025-02-05 17:52:51,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:51,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:51,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:51,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:51,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:51,009 INFO L87 Difference]: Start difference. First operand 11211 states and 16088 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:52:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:51,981 INFO L93 Difference]: Finished difference Result 32893 states and 47860 transitions. [2025-02-05 17:52:51,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:51,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2025-02-05 17:52:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:52,065 INFO L225 Difference]: With dead ends: 32893 [2025-02-05 17:52:52,066 INFO L226 Difference]: Without dead ends: 21695 [2025-02-05 17:52:52,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:52,106 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 158 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:52,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 538 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21695 states. [2025-02-05 17:52:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21695 to 21695. [2025-02-05 17:52:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21695 states, 17939 states have (on average 1.3866993700875188) internal successors, (24876), 18665 states have internal predecessors, (24876), 1869 states have call successors, (1869), 1198 states have call predecessors, (1869), 1886 states have return successors, (4542), 1863 states have call predecessors, (4542), 1869 states have call successors, (4542) [2025-02-05 17:52:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21695 states to 21695 states and 31287 transitions. [2025-02-05 17:52:53,198 INFO L78 Accepts]: Start accepts. Automaton has 21695 states and 31287 transitions. Word has length 112 [2025-02-05 17:52:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:53,199 INFO L471 AbstractCegarLoop]: Abstraction has 21695 states and 31287 transitions. [2025-02-05 17:52:53,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:52:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 21695 states and 31287 transitions. [2025-02-05 17:52:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 17:52:53,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:53,253 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:52:53,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 17:52:53,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:52:53,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:53,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash -453775880, now seen corresponding path program 1 times [2025-02-05 17:52:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:53,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789029037] [2025-02-05 17:52:53,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:53,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 17:52:53,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 17:52:53,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:53,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-05 17:52:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789029037] [2025-02-05 17:52:53,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789029037] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:52:53,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258136219] [2025-02-05 17:52:53,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:53,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:52:53,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:52:53,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:52:53,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:52:53,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 17:52:53,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 17:52:53,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:53,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:53,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:52:53,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:52:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 17:52:53,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:52:53,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258136219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:53,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:52:53,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:52:53,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420397716] [2025-02-05 17:52:53,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:53,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:53,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:53,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:53,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:53,729 INFO L87 Difference]: Start difference. First operand 21695 states and 31287 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:52:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:54,551 INFO L93 Difference]: Finished difference Result 45809 states and 68631 transitions. [2025-02-05 17:52:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:54,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2025-02-05 17:52:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:54,631 INFO L225 Difference]: With dead ends: 45809 [2025-02-05 17:52:54,631 INFO L226 Difference]: Without dead ends: 24129 [2025-02-05 17:52:54,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:54,678 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 119 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:54,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 218 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:52:54,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24129 states. [2025-02-05 17:52:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24129 to 24129. [2025-02-05 17:52:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24129 states, 20161 states have (on average 1.3383264719011954) internal successors, (26982), 20887 states have internal predecessors, (26982), 1923 states have call successors, (1923), 1356 states have call predecessors, (1923), 2044 states have return successors, (4610), 1917 states have call predecessors, (4610), 1923 states have call successors, (4610) [2025-02-05 17:52:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24129 states to 24129 states and 33515 transitions. [2025-02-05 17:52:55,971 INFO L78 Accepts]: Start accepts. Automaton has 24129 states and 33515 transitions. Word has length 164 [2025-02-05 17:52:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:55,972 INFO L471 AbstractCegarLoop]: Abstraction has 24129 states and 33515 transitions. [2025-02-05 17:52:55,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:52:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 24129 states and 33515 transitions. [2025-02-05 17:52:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 17:52:56,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:56,017 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:52:56,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 17:52:56,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 17:52:56,221 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:56,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1337549113, now seen corresponding path program 1 times [2025-02-05 17:52:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:56,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339646381] [2025-02-05 17:52:56,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:56,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:56,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 17:52:56,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 17:52:56,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:56,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-05 17:52:56,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:56,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339646381] [2025-02-05 17:52:56,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339646381] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:52:56,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937215243] [2025-02-05 17:52:56,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:56,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:52:56,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:52:56,299 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:52:56,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:52:56,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 17:52:56,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 17:52:56,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:56,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:56,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:52:56,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:52:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 17:52:56,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:52:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937215243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:56,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:52:56,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:52:56,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358797385] [2025-02-05 17:52:56,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:56,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:56,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:56,467 INFO L87 Difference]: Start difference. First operand 24129 states and 33515 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:52:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:57,468 INFO L93 Difference]: Finished difference Result 40233 states and 56440 transitions. [2025-02-05 17:52:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:57,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 164 [2025-02-05 17:52:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:57,567 INFO L225 Difference]: With dead ends: 40233 [2025-02-05 17:52:57,568 INFO L226 Difference]: Without dead ends: 20643 [2025-02-05 17:52:57,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:57,605 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 134 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:57,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 216 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:57,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20643 states. [2025-02-05 17:52:58,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20643 to 15011. [2025-02-05 17:52:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15011 states, 12743 states have (on average 1.296084124617437) internal successors, (16516), 12975 states have internal predecessors, (16516), 1183 states have call successors, (1183), 876 states have call predecessors, (1183), 1084 states have return successors, (1942), 1175 states have call predecessors, (1942), 1183 states have call successors, (1942) [2025-02-05 17:52:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15011 states to 15011 states and 19641 transitions. [2025-02-05 17:52:58,501 INFO L78 Accepts]: Start accepts. Automaton has 15011 states and 19641 transitions. Word has length 164 [2025-02-05 17:52:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:58,502 INFO L471 AbstractCegarLoop]: Abstraction has 15011 states and 19641 transitions. [2025-02-05 17:52:58,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:52:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 15011 states and 19641 transitions. [2025-02-05 17:52:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-05 17:52:58,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:58,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:52:58,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 17:52:58,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 17:52:58,722 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:58,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:58,723 INFO L85 PathProgramCache]: Analyzing trace with hash 751863800, now seen corresponding path program 1 times [2025-02-05 17:52:58,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:58,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813404689] [2025-02-05 17:52:58,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:58,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:58,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 17:52:58,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 17:52:58,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:58,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-05 17:52:58,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:58,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813404689] [2025-02-05 17:52:58,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813404689] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:52:58,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423585747] [2025-02-05 17:52:58,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:58,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:52:58,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:52:58,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:52:58,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:52:58,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-05 17:52:58,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-05 17:52:58,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:58,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:58,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 17:52:58,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:52:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 17:52:58,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:52:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423585747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:58,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:52:58,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:52:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684496426] [2025-02-05 17:52:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:58,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:58,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:58,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:58,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:58,936 INFO L87 Difference]: Start difference. First operand 15011 states and 19641 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:52:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:59,450 INFO L93 Difference]: Finished difference Result 26359 states and 34394 transitions. [2025-02-05 17:52:59,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:59,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 164 [2025-02-05 17:52:59,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:59,490 INFO L225 Difference]: With dead ends: 26359 [2025-02-05 17:52:59,491 INFO L226 Difference]: Without dead ends: 15945 [2025-02-05 17:52:59,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:59,503 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 130 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:59,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 389 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15945 states. [2025-02-05 17:52:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15945 to 15835. [2025-02-05 17:52:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15835 states, 13523 states have (on average 1.2756045256230126) internal successors, (17250), 13755 states have internal predecessors, (17250), 1183 states have call successors, (1183), 920 states have call predecessors, (1183), 1128 states have return successors, (1986), 1175 states have call predecessors, (1986), 1183 states have call successors, (1986) [2025-02-05 17:53:00,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15835 states to 15835 states and 20419 transitions. [2025-02-05 17:53:00,030 INFO L78 Accepts]: Start accepts. Automaton has 15835 states and 20419 transitions. Word has length 164 [2025-02-05 17:53:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:00,031 INFO L471 AbstractCegarLoop]: Abstraction has 15835 states and 20419 transitions. [2025-02-05 17:53:00,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:53:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 15835 states and 20419 transitions. [2025-02-05 17:53:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 17:53:00,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:00,048 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:00,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 17:53:00,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 17:53:00,253 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:00,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1431542298, now seen corresponding path program 1 times [2025-02-05 17:53:00,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:00,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637987998] [2025-02-05 17:53:00,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:00,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:00,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 17:53:00,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 17:53:00,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:00,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-02-05 17:53:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637987998] [2025-02-05 17:53:00,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637987998] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:53:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720561686] [2025-02-05 17:53:00,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:00,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:53:00,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:53:00,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:53:00,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 17:53:00,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 17:53:00,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 17:53:00,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:00,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:00,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:53:00,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:53:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-05 17:53:00,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:53:00,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720561686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:00,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:53:00,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:53:00,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850592903] [2025-02-05 17:53:00,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:00,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:00,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:00,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:00,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:00,432 INFO L87 Difference]: Start difference. First operand 15835 states and 20419 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:53:01,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:01,846 INFO L93 Difference]: Finished difference Result 45145 states and 58873 transitions. [2025-02-05 17:53:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 165 [2025-02-05 17:53:01,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:01,942 INFO L225 Difference]: With dead ends: 45145 [2025-02-05 17:53:01,943 INFO L226 Difference]: Without dead ends: 29329 [2025-02-05 17:53:01,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:01,980 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 141 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:01,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 517 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29329 states. [2025-02-05 17:53:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29329 to 29327. [2025-02-05 17:53:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29327 states, 24945 states have (on average 1.2666265784726398) internal successors, (31596), 25409 states have internal predecessors, (31596), 2245 states have call successors, (2245), 1720 states have call predecessors, (2245), 2136 states have return successors, (4298), 2229 states have call predecessors, (4298), 2245 states have call successors, (4298) [2025-02-05 17:53:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29327 states to 29327 states and 38139 transitions. [2025-02-05 17:53:03,692 INFO L78 Accepts]: Start accepts. Automaton has 29327 states and 38139 transitions. Word has length 165 [2025-02-05 17:53:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:03,692 INFO L471 AbstractCegarLoop]: Abstraction has 29327 states and 38139 transitions. [2025-02-05 17:53:03,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:53:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 29327 states and 38139 transitions. [2025-02-05 17:53:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 17:53:03,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:03,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:03,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 17:53:03,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:53:03,926 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:03,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:03,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1305717853, now seen corresponding path program 1 times [2025-02-05 17:53:03,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:03,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511463286] [2025-02-05 17:53:03,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:03,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:03,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:53:03,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:53:03,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:03,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 17:53:03,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511463286] [2025-02-05 17:53:03,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511463286] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:53:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477011765] [2025-02-05 17:53:03,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:03,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:53:03,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:53:03,986 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:53:03,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 17:53:04,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:53:04,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:53:04,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:04,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:04,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:53:04,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:53:04,110 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-05 17:53:04,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:53:04,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477011765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:04,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:53:04,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:53:04,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939354254] [2025-02-05 17:53:04,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:04,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:04,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:04,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:04,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:04,112 INFO L87 Difference]: Start difference. First operand 29327 states and 38139 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:53:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:04,874 INFO L93 Difference]: Finished difference Result 50785 states and 67034 transitions. [2025-02-05 17:53:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:04,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2025-02-05 17:53:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:04,948 INFO L225 Difference]: With dead ends: 50785 [2025-02-05 17:53:04,949 INFO L226 Difference]: Without dead ends: 24405 [2025-02-05 17:53:04,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:04,993 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 140 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:04,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 217 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24405 states. [2025-02-05 17:53:05,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24405 to 22961. [2025-02-05 17:53:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22961 states, 19627 states have (on average 1.2309573546644927) internal successors, (24160), 19867 states have internal predecessors, (24160), 1777 states have call successors, (1777), 1364 states have call predecessors, (1777), 1556 states have return successors, (2834), 1745 states have call predecessors, (2834), 1777 states have call successors, (2834) [2025-02-05 17:53:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22961 states to 22961 states and 28771 transitions. [2025-02-05 17:53:05,849 INFO L78 Accepts]: Start accepts. Automaton has 22961 states and 28771 transitions. Word has length 166 [2025-02-05 17:53:05,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:05,849 INFO L471 AbstractCegarLoop]: Abstraction has 22961 states and 28771 transitions. [2025-02-05 17:53:05,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:53:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 22961 states and 28771 transitions. [2025-02-05 17:53:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 17:53:05,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:05,869 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:05,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 17:53:06,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:53:06,074 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:06,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash 847501761, now seen corresponding path program 1 times [2025-02-05 17:53:06,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:06,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040952161] [2025-02-05 17:53:06,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:06,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:06,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:53:06,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:53:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 17:53:06,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:06,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040952161] [2025-02-05 17:53:06,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040952161] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:53:06,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929810274] [2025-02-05 17:53:06,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:06,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:53:06,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:53:06,133 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:53:06,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 17:53:06,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:53:06,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:53:06,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:06,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:06,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:53:06,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:53:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 17:53:06,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:53:06,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929810274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:06,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:53:06,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:53:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386865345] [2025-02-05 17:53:06,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:06,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:06,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:06,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:06,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:06,230 INFO L87 Difference]: Start difference. First operand 22961 states and 28771 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:53:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:07,454 INFO L93 Difference]: Finished difference Result 65403 states and 82859 transitions. [2025-02-05 17:53:07,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:07,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 166 [2025-02-05 17:53:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:07,583 INFO L225 Difference]: With dead ends: 65403 [2025-02-05 17:53:07,583 INFO L226 Difference]: Without dead ends: 42469 [2025-02-05 17:53:07,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:07,632 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 147 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:07,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 508 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42469 states. [2025-02-05 17:53:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42469 to 42467. [2025-02-05 17:53:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42467 states, 36153 states have (on average 1.2184880922745) internal successors, (44052), 36633 states have internal predecessors, (44052), 3377 states have call successors, (3377), 2552 states have call predecessors, (3377), 2936 states have return successors, (6168), 3313 states have call predecessors, (6168), 3377 states have call successors, (6168) [2025-02-05 17:53:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42467 states to 42467 states and 53597 transitions. [2025-02-05 17:53:09,314 INFO L78 Accepts]: Start accepts. Automaton has 42467 states and 53597 transitions. Word has length 166 [2025-02-05 17:53:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:09,315 INFO L471 AbstractCegarLoop]: Abstraction has 42467 states and 53597 transitions. [2025-02-05 17:53:09,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:53:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 42467 states and 53597 transitions. [2025-02-05 17:53:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 17:53:09,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:09,345 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:09,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 17:53:09,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:53:09,546 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:09,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1134250223, now seen corresponding path program 1 times [2025-02-05 17:53:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:09,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682548049] [2025-02-05 17:53:09,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:09,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:09,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:53:09,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:53:09,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:09,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 17:53:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682548049] [2025-02-05 17:53:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682548049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:53:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758797354] [2025-02-05 17:53:09,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:09,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:53:09,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:53:09,601 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:53:09,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 17:53:09,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:53:09,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:53:09,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:09,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:09,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 17:53:09,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:53:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 17:53:09,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:53:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758797354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:09,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:53:09,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:53:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9286792] [2025-02-05 17:53:09,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:09,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:09,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:09,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:09,724 INFO L87 Difference]: Start difference. First operand 42467 states and 53597 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:53:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:11,158 INFO L93 Difference]: Finished difference Result 75911 states and 96061 transitions. [2025-02-05 17:53:11,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:11,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 166 [2025-02-05 17:53:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:11,291 INFO L225 Difference]: With dead ends: 75911 [2025-02-05 17:53:11,291 INFO L226 Difference]: Without dead ends: 43565 [2025-02-05 17:53:11,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:11,340 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 136 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:11,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 368 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43565 states. [2025-02-05 17:53:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43565 to 42375. [2025-02-05 17:53:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42375 states, 36061 states have (on average 1.2101161920079864) internal successors, (43638), 36541 states have internal predecessors, (43638), 3377 states have call successors, (3377), 2552 states have call predecessors, (3377), 2936 states have return successors, (6168), 3313 states have call predecessors, (6168), 3377 states have call successors, (6168) [2025-02-05 17:53:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42375 states to 42375 states and 53183 transitions. [2025-02-05 17:53:13,456 INFO L78 Accepts]: Start accepts. Automaton has 42375 states and 53183 transitions. Word has length 166 [2025-02-05 17:53:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:13,456 INFO L471 AbstractCegarLoop]: Abstraction has 42375 states and 53183 transitions. [2025-02-05 17:53:13,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:53:13,457 INFO L276 IsEmpty]: Start isEmpty. Operand 42375 states and 53183 transitions. [2025-02-05 17:53:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 17:53:13,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:13,496 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:13,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 17:53:13,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:53:13,697 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:13,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:13,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1340184306, now seen corresponding path program 1 times [2025-02-05 17:53:13,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:13,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216474617] [2025-02-05 17:53:13,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:13,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 17:53:13,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 17:53:13,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:13,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:13,727 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 17:53:13,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:13,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216474617] [2025-02-05 17:53:13,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216474617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:13,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:13,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19518885] [2025-02-05 17:53:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:13,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:13,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:13,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:13,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:13,729 INFO L87 Difference]: Start difference. First operand 42375 states and 53183 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:53:15,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:15,137 INFO L93 Difference]: Finished difference Result 74633 states and 93530 transitions. [2025-02-05 17:53:15,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:15,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 166 [2025-02-05 17:53:15,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:15,256 INFO L225 Difference]: With dead ends: 74633 [2025-02-05 17:53:15,256 INFO L226 Difference]: Without dead ends: 32281 [2025-02-05 17:53:15,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:15,326 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 174 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:15,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32281 states. [2025-02-05 17:53:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32281 to 32281. [2025-02-05 17:53:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32281 states, 27531 states have (on average 1.2147760706113109) internal successors, (33444), 27887 states have internal predecessors, (33444), 2533 states have call successors, (2533), 1928 states have call predecessors, (2533), 2216 states have return successors, (4410), 2481 states have call predecessors, (4410), 2533 states have call successors, (4410) [2025-02-05 17:53:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32281 states to 32281 states and 40387 transitions. [2025-02-05 17:53:16,821 INFO L78 Accepts]: Start accepts. Automaton has 32281 states and 40387 transitions. Word has length 166 [2025-02-05 17:53:16,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:16,822 INFO L471 AbstractCegarLoop]: Abstraction has 32281 states and 40387 transitions. [2025-02-05 17:53:16,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:53:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 32281 states and 40387 transitions. [2025-02-05 17:53:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:53:16,849 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:16,849 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:16,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 17:53:16,849 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:16,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:16,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2108339892, now seen corresponding path program 1 times [2025-02-05 17:53:16,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:16,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338641894] [2025-02-05 17:53:16,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:16,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:16,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:53:16,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:53:16,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:16,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-05 17:53:16,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:16,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338641894] [2025-02-05 17:53:16,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338641894] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:53:16,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707796261] [2025-02-05 17:53:16,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:16,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:53:16,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:53:16,906 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:53:16,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 17:53:16,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:53:16,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:53:16,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:16,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:16,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 17:53:16,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:53:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 17:53:17,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:53:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707796261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:17,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:53:17,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:53:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737032558] [2025-02-05 17:53:17,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:17,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:17,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:17,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:17,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:17,032 INFO L87 Difference]: Start difference. First operand 32281 states and 40387 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:53:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:18,200 INFO L93 Difference]: Finished difference Result 57710 states and 72232 transitions. [2025-02-05 17:53:18,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:18,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 167 [2025-02-05 17:53:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:18,313 INFO L225 Difference]: With dead ends: 57710 [2025-02-05 17:53:18,313 INFO L226 Difference]: Without dead ends: 32759 [2025-02-05 17:53:18,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:18,359 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 134 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:18,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 356 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32759 states. [2025-02-05 17:53:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32759 to 32281. [2025-02-05 17:53:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32281 states, 27531 states have (on average 1.2090370854672914) internal successors, (33286), 27887 states have internal predecessors, (33286), 2533 states have call successors, (2533), 1928 states have call predecessors, (2533), 2216 states have return successors, (4410), 2481 states have call predecessors, (4410), 2533 states have call successors, (4410) [2025-02-05 17:53:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32281 states to 32281 states and 40229 transitions. [2025-02-05 17:53:19,763 INFO L78 Accepts]: Start accepts. Automaton has 32281 states and 40229 transitions. Word has length 167 [2025-02-05 17:53:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:19,763 INFO L471 AbstractCegarLoop]: Abstraction has 32281 states and 40229 transitions. [2025-02-05 17:53:19,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:53:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 32281 states and 40229 transitions. [2025-02-05 17:53:19,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:53:19,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:19,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:53:19,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 17:53:19,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-05 17:53:19,989 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:19,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:19,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1916941940, now seen corresponding path program 1 times [2025-02-05 17:53:19,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:19,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918217278] [2025-02-05 17:53:19,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:19,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:53:19,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:53:19,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:19,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-02-05 17:53:20,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:20,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918217278] [2025-02-05 17:53:20,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918217278] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:20,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:20,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:53:20,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664735477] [2025-02-05 17:53:20,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:20,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:53:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:20,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:53:20,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:20,015 INFO L87 Difference]: Start difference. First operand 32281 states and 40229 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:53:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:21,207 INFO L93 Difference]: Finished difference Result 57234 states and 71249 transitions. [2025-02-05 17:53:21,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:53:21,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 167 [2025-02-05 17:53:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:21,299 INFO L225 Difference]: With dead ends: 57234 [2025-02-05 17:53:21,300 INFO L226 Difference]: Without dead ends: 24970 [2025-02-05 17:53:21,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:53:21,347 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 172 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:21,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 180 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:53:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24970 states.