./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0d0248500070fcb488ef1ad28c8f201e8340587643ff9baf1ad195abca806e8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:30:13,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:30:14,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:30:14,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:30:14,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:30:14,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:30:14,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:30:14,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:30:14,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:30:14,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:30:14,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:30:14,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:30:14,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:30:14,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:30:14,046 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:30:14,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:30:14,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:30:14,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:30:14,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:30:14,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:30:14,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:30:14,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:30:14,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:30:14,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:30:14,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:30:14,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:30:14,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:30:14,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:30:14,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:30:14,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:30:14,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:30:14,048 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/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 -> 0d0248500070fcb488ef1ad28c8f201e8340587643ff9baf1ad195abca806e8b [2025-03-08 16:30:14,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:30:14,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:30:14,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:30:14,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:30:14,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:30:14,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i [2025-03-08 16:30:15,429 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/865f6b9c9/8784154a7c2f467eba8cd070bf24c816/FLAG87e4643a8 [2025-03-08 16:30:15,685 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:30:15,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i [2025-03-08 16:30:15,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/865f6b9c9/8784154a7c2f467eba8cd070bf24c816/FLAG87e4643a8 [2025-03-08 16:30:16,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/865f6b9c9/8784154a7c2f467eba8cd070bf24c816 [2025-03-08 16:30:16,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:30:16,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:30:16,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:30:16,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:30:16,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:30:16,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263c013a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16, skipping insertion in model container [2025-03-08 16:30:16,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,036 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:30:16,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i[917,930] [2025-03-08 16:30:16,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:30:16,164 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:30:16,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-59.i[917,930] [2025-03-08 16:30:16,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:30:16,210 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:30:16,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16 WrapperNode [2025-03-08 16:30:16,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:30:16,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:30:16,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:30:16,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:30:16,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,250 INFO L138 Inliner]: procedures = 26, calls = 129, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 359 [2025-03-08 16:30:16,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:30:16,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:30:16,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:30:16,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:30:16,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,278 INFO L175 MemorySlicer]: Split 96 memory accesses to 5 slices as follows [2, 12, 32, 24, 26]. 33 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 4, 3, 3]. The 16 writes are split as follows [0, 2, 6, 4, 4]. [2025-03-08 16:30:16,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,293 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:30:16,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:30:16,303 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:30:16,303 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:30:16,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (1/1) ... [2025-03-08 16:30:16,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:30:16,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:30:16,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:30:16,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:30:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:30:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:30:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:30:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:30:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:30:16,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:30:16,358 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:30:16,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:30:16,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:30:16,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:30:16,456 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:30:16,458 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:30:16,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem55#1;havoc property_#t~ite57#1;havoc property_#t~mem56#1;havoc property_#t~ite65#1;havoc property_#t~mem61#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem64#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite78#1;havoc property_#t~mem68#1;havoc property_#t~ite75#1;havoc property_#t~mem72#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~short79#1;havoc property_#t~ite89#1;havoc property_#t~mem82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~short85#1;havoc property_#t~ite88#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1; [2025-03-08 16:30:16,781 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-03-08 16:30:16,781 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:30:16,788 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:30:16,788 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:30:16,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:30:16 BoogieIcfgContainer [2025-03-08 16:30:16,790 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:30:16,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:30:16,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:30:16,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:30:16,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:30:16" (1/3) ... [2025-03-08 16:30:16,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d200e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:30:16, skipping insertion in model container [2025-03-08 16:30:16,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:30:16" (2/3) ... [2025-03-08 16:30:16,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d200e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:30:16, skipping insertion in model container [2025-03-08 16:30:16,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:30:16" (3/3) ... [2025-03-08 16:30:16,796 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-59.i [2025-03-08 16:30:16,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:30:16,811 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-59.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:30:16,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:30:16,873 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;@4ae1c157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:30:16,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:30:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:30:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:30:16,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:16,884 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:16,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:16,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:16,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1339569664, now seen corresponding path program 1 times [2025-03-08 16:30:16,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:16,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014619223] [2025-03-08 16:30:16,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:16,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:16,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:30:16,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:30:16,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:16,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:30:17,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:17,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014619223] [2025-03-08 16:30:17,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014619223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:30:17,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735988690] [2025-03-08 16:30:17,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:17,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:17,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:30:17,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:30:17,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:30:17,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:30:17,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:30:17,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:17,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:17,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:30:17,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:30:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:30:17,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:30:17,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735988690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:17,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:30:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:30:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172339275] [2025-03-08 16:30:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:17,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:30:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:17,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:30:17,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:30:17,398 INFO L87 Difference]: Start difference. First operand has 83 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:17,421 INFO L93 Difference]: Finished difference Result 160 states and 253 transitions. [2025-03-08 16:30:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:30:17,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 131 [2025-03-08 16:30:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:17,428 INFO L225 Difference]: With dead ends: 160 [2025-03-08 16:30:17,429 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 16:30:17,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:30:17,436 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:17,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:30:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 16:30:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-08 16:30:17,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 60 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:30:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2025-03-08 16:30:17,469 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 131 [2025-03-08 16:30:17,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:17,469 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2025-03-08 16:30:17,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2025-03-08 16:30:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:30:17,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:17,473 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:17,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:30:17,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:30:17,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:17,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash 594855918, now seen corresponding path program 1 times [2025-03-08 16:30:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327234369] [2025-03-08 16:30:17,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:17,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:30:17,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:30:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327234369] [2025-03-08 16:30:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327234369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:30:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585362122] [2025-03-08 16:30:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:18,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:30:18,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:18,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:30:18,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:30:18,069 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:18,230 INFO L93 Difference]: Finished difference Result 216 states and 310 transitions. [2025-03-08 16:30:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:30:18,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 131 [2025-03-08 16:30:18,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:18,234 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:30:18,236 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 16:30:18,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:30:18,237 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 81 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:18,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 307 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:30:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 16:30:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2025-03-08 16:30:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 101 states have (on average 1.297029702970297) internal successors, (131), 102 states have internal predecessors, (131), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 16:30:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 195 transitions. [2025-03-08 16:30:18,260 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 195 transitions. Word has length 131 [2025-03-08 16:30:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:18,261 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 195 transitions. [2025-03-08 16:30:18,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 195 transitions. [2025-03-08 16:30:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:30:18,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:18,264 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:18,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:30:18,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:18,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:18,266 INFO L85 PathProgramCache]: Analyzing trace with hash 398342413, now seen corresponding path program 1 times [2025-03-08 16:30:18,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:18,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587180358] [2025-03-08 16:30:18,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:18,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:30:18,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:30:18,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:18,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:18,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:18,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587180358] [2025-03-08 16:30:18,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587180358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:18,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:18,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:30:18,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047173815] [2025-03-08 16:30:18,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:18,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:30:18,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:18,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:30:18,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:30:18,577 INFO L87 Difference]: Start difference. First operand 136 states and 195 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:30:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:18,849 INFO L93 Difference]: Finished difference Result 375 states and 538 transitions. [2025-03-08 16:30:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:30:18,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 131 [2025-03-08 16:30:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:18,855 INFO L225 Difference]: With dead ends: 375 [2025-03-08 16:30:18,857 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 16:30:18,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:30:18,858 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 139 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:18,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 348 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:30:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 16:30:18,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 224. [2025-03-08 16:30:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 170 states have internal predecessors, (221), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:30:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 321 transitions. [2025-03-08 16:30:18,893 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 321 transitions. Word has length 131 [2025-03-08 16:30:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:18,893 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 321 transitions. [2025-03-08 16:30:18,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:30:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 321 transitions. [2025-03-08 16:30:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:30:18,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:18,896 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:18,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:30:18,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:18,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1556609901, now seen corresponding path program 1 times [2025-03-08 16:30:18,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:18,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908823314] [2025-03-08 16:30:18,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:18,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:18,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:30:18,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:30:18,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:18,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:19,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:19,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908823314] [2025-03-08 16:30:19,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908823314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:19,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:19,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:30:19,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193144049] [2025-03-08 16:30:19,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:19,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:30:19,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:19,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:30:19,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:30:19,575 INFO L87 Difference]: Start difference. First operand 224 states and 321 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:19,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:19,868 INFO L93 Difference]: Finished difference Result 481 states and 688 transitions. [2025-03-08 16:30:19,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:30:19,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2025-03-08 16:30:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:19,871 INFO L225 Difference]: With dead ends: 481 [2025-03-08 16:30:19,872 INFO L226 Difference]: Without dead ends: 336 [2025-03-08 16:30:19,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:30:19,875 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 247 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:19,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 364 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:30:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-08 16:30:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2025-03-08 16:30:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 270 states have internal predecessors, (355), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 471 transitions. [2025-03-08 16:30:19,930 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 471 transitions. Word has length 133 [2025-03-08 16:30:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:19,930 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 471 transitions. [2025-03-08 16:30:19,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 471 transitions. [2025-03-08 16:30:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:30:19,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:19,932 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:19,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:30:19,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:19,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash 930902932, now seen corresponding path program 1 times [2025-03-08 16:30:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:19,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639447553] [2025-03-08 16:30:19,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:19,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:30:19,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:30:19,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:19,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639447553] [2025-03-08 16:30:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639447553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:20,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:30:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819630839] [2025-03-08 16:30:20,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:20,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:30:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:20,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:30:20,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:30:20,063 INFO L87 Difference]: Start difference. First operand 332 states and 471 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:20,223 INFO L93 Difference]: Finished difference Result 692 states and 989 transitions. [2025-03-08 16:30:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:30:20,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2025-03-08 16:30:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:20,226 INFO L225 Difference]: With dead ends: 692 [2025-03-08 16:30:20,226 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 16:30:20,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:30:20,227 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 129 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:20,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 358 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:30:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 16:30:20,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 351. [2025-03-08 16:30:20,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 286 states have (on average 1.3216783216783217) internal successors, (378), 289 states have internal predecessors, (378), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 494 transitions. [2025-03-08 16:30:20,263 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 494 transitions. Word has length 133 [2025-03-08 16:30:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:20,263 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 494 transitions. [2025-03-08 16:30:20,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 494 transitions. [2025-03-08 16:30:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:30:20,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:20,265 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:20,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:30:20,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:20,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:20,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1427527182, now seen corresponding path program 1 times [2025-03-08 16:30:20,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:20,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475847618] [2025-03-08 16:30:20,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:20,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:30:20,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:30:20,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:20,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:20,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:20,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475847618] [2025-03-08 16:30:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475847618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:20,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:20,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:30:20,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717188585] [2025-03-08 16:30:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:20,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:30:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:20,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:30:20,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:30:20,398 INFO L87 Difference]: Start difference. First operand 351 states and 494 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:20,557 INFO L93 Difference]: Finished difference Result 646 states and 910 transitions. [2025-03-08 16:30:20,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:30:20,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2025-03-08 16:30:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:20,562 INFO L225 Difference]: With dead ends: 646 [2025-03-08 16:30:20,563 INFO L226 Difference]: Without dead ends: 405 [2025-03-08 16:30:20,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:30:20,564 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 97 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:20,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 454 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:30:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-08 16:30:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 333. [2025-03-08 16:30:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 268 states have (on average 1.3134328358208955) internal successors, (352), 271 states have internal predecessors, (352), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 468 transitions. [2025-03-08 16:30:20,588 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 468 transitions. Word has length 133 [2025-03-08 16:30:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:20,588 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 468 transitions. [2025-03-08 16:30:20,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 468 transitions. [2025-03-08 16:30:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:30:20,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:20,589 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:20,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:30:20,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:20,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1420819444, now seen corresponding path program 1 times [2025-03-08 16:30:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:20,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298718575] [2025-03-08 16:30:20,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:20,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:30:20,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:30:20,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:20,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:20,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298718575] [2025-03-08 16:30:20,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298718575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:20,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:20,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:30:20,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039415312] [2025-03-08 16:30:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:20,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:30:20,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:20,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:30:20,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:30:20,720 INFO L87 Difference]: Start difference. First operand 333 states and 468 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:20,804 INFO L93 Difference]: Finished difference Result 569 states and 801 transitions. [2025-03-08 16:30:20,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:30:20,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-03-08 16:30:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:20,806 INFO L225 Difference]: With dead ends: 569 [2025-03-08 16:30:20,806 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 16:30:20,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03-08 16:30:20,807 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 36 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:20,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 478 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:30:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 16:30:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 330. [2025-03-08 16:30:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 265 states have (on average 1.3094339622641509) internal successors, (347), 268 states have internal predecessors, (347), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 463 transitions. [2025-03-08 16:30:20,831 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 463 transitions. Word has length 133 [2025-03-08 16:30:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:20,831 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 463 transitions. [2025-03-08 16:30:20,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 463 transitions. [2025-03-08 16:30:20,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:30:20,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:20,832 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:20,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:30:20,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:20,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash -937610670, now seen corresponding path program 1 times [2025-03-08 16:30:20,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:20,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407945626] [2025-03-08 16:30:20,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:20,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:30:20,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:30:20,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:20,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:20,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407945626] [2025-03-08 16:30:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407945626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:20,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:30:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342353038] [2025-03-08 16:30:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:20,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:30:20,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:20,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:30:20,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:30:20,953 INFO L87 Difference]: Start difference. First operand 330 states and 463 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:21,032 INFO L93 Difference]: Finished difference Result 568 states and 799 transitions. [2025-03-08 16:30:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:30:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2025-03-08 16:30:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:21,034 INFO L225 Difference]: With dead ends: 568 [2025-03-08 16:30:21,034 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 16:30:21,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:30:21,035 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 33 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:21,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 417 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:30:21,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 16:30:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2025-03-08 16:30:21,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 266 states have (on average 1.3045112781954886) internal successors, (347), 269 states have internal predecessors, (347), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 463 transitions. [2025-03-08 16:30:21,056 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 463 transitions. Word has length 133 [2025-03-08 16:30:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:21,057 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 463 transitions. [2025-03-08 16:30:21,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 463 transitions. [2025-03-08 16:30:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:30:21,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:21,058 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:21,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:30:21,058 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:21,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:21,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1549902163, now seen corresponding path program 1 times [2025-03-08 16:30:21,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:21,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500210554] [2025-03-08 16:30:21,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:21,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:21,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:30:21,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:30:21,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:21,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:21,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500210554] [2025-03-08 16:30:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500210554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:21,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:21,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:30:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752647101] [2025-03-08 16:30:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:21,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:30:21,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:21,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:30:21,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:30:21,350 INFO L87 Difference]: Start difference. First operand 331 states and 463 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:30:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:21,550 INFO L93 Difference]: Finished difference Result 573 states and 798 transitions. [2025-03-08 16:30:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:30:21,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 133 [2025-03-08 16:30:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:21,553 INFO L225 Difference]: With dead ends: 573 [2025-03-08 16:30:21,553 INFO L226 Difference]: Without dead ends: 333 [2025-03-08 16:30:21,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:30:21,554 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 113 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:21,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 410 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:30:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-08 16:30:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 315. [2025-03-08 16:30:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 250 states have (on average 1.292) internal successors, (323), 253 states have internal predecessors, (323), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 439 transitions. [2025-03-08 16:30:21,578 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 439 transitions. Word has length 133 [2025-03-08 16:30:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:21,578 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 439 transitions. [2025-03-08 16:30:21,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:30:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 439 transitions. [2025-03-08 16:30:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:30:21,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:21,579 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:21,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:30:21,579 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:21,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash 316662733, now seen corresponding path program 1 times [2025-03-08 16:30:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:21,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338596265] [2025-03-08 16:30:21,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:21,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:30:21,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:30:21,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:21,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:21,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:21,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338596265] [2025-03-08 16:30:21,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338596265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:21,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:21,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:30:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763598282] [2025-03-08 16:30:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:21,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:30:21,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:21,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:30:21,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:30:21,884 INFO L87 Difference]: Start difference. First operand 315 states and 439 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:22,085 INFO L93 Difference]: Finished difference Result 757 states and 1051 transitions. [2025-03-08 16:30:22,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:30:22,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2025-03-08 16:30:22,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:22,089 INFO L225 Difference]: With dead ends: 757 [2025-03-08 16:30:22,089 INFO L226 Difference]: Without dead ends: 533 [2025-03-08 16:30:22,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:30:22,090 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 143 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:22,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 545 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:30:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-08 16:30:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 383. [2025-03-08 16:30:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 318 states have (on average 1.2955974842767295) internal successors, (412), 321 states have internal predecessors, (412), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 528 transitions. [2025-03-08 16:30:22,122 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 528 transitions. Word has length 135 [2025-03-08 16:30:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:22,122 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 528 transitions. [2025-03-08 16:30:22,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 528 transitions. [2025-03-08 16:30:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 16:30:22,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:22,123 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:22,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:30:22,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:22,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash -62653148, now seen corresponding path program 1 times [2025-03-08 16:30:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:22,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809124937] [2025-03-08 16:30:22,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:22,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:30:22,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:30:22,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:22,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:30:22,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363871193] [2025-03-08 16:30:22,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:22,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:30:22,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:30:22,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:30:22,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 16:30:22,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 16:30:22,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:22,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:22,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 16:30:22,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:30:22,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:30:23,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:24,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:30:24,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:30:24,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:30:24,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 16:30:24,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:30:24,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:30:24,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:30:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-08 16:30:24,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:30:29,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:29,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809124937] [2025-03-08 16:30:29,466 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:30:29,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363871193] [2025-03-08 16:30:29,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363871193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:30:29,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:30:29,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-08 16:30:29,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768695457] [2025-03-08 16:30:29,466 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 16:30:29,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:30:29,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:29,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:30:29,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2025-03-08 16:30:29,467 INFO L87 Difference]: Start difference. First operand 383 states and 528 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:30,177 INFO L93 Difference]: Finished difference Result 721 states and 991 transitions. [2025-03-08 16:30:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:30:30,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2025-03-08 16:30:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:30,180 INFO L225 Difference]: With dead ends: 721 [2025-03-08 16:30:30,180 INFO L226 Difference]: Without dead ends: 437 [2025-03-08 16:30:30,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=92, Invalid=249, Unknown=1, NotChecked=0, Total=342 [2025-03-08 16:30:30,181 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:30,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 543 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:30:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-03-08 16:30:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 383. [2025-03-08 16:30:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 318 states have (on average 1.2893081761006289) internal successors, (410), 321 states have internal predecessors, (410), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 526 transitions. [2025-03-08 16:30:30,209 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 526 transitions. Word has length 136 [2025-03-08 16:30:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:30,209 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 526 transitions. [2025-03-08 16:30:30,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 526 transitions. [2025-03-08 16:30:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 16:30:30,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:30,213 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:30,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:30:30,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 16:30:30,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:30,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1628177647, now seen corresponding path program 1 times [2025-03-08 16:30:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:30,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043681450] [2025-03-08 16:30:30,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:30,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:30,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:30:30,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:30:30,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:30,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:30:30,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241366679] [2025-03-08 16:30:30,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:30,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:30,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:30:30,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:30:30,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:30:30,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 16:30:30,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 16:30:30,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:30,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:30,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 16:30:30,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:30:31,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:31,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:32,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2025-03-08 16:30:32,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:30:32,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2025-03-08 16:30:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-08 16:30:32,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:30:37,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043681450] [2025-03-08 16:30:37,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:30:37,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241366679] [2025-03-08 16:30:37,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241366679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:30:37,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:30:37,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-08 16:30:37,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897640471] [2025-03-08 16:30:37,080 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 16:30:37,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:30:37,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:37,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:30:37,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2025-03-08 16:30:37,081 INFO L87 Difference]: Start difference. First operand 383 states and 526 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:37,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:37,568 INFO L93 Difference]: Finished difference Result 719 states and 984 transitions. [2025-03-08 16:30:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:30:37,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2025-03-08 16:30:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:37,572 INFO L225 Difference]: With dead ends: 719 [2025-03-08 16:30:37,572 INFO L226 Difference]: Without dead ends: 431 [2025-03-08 16:30:37,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=92, Invalid=249, Unknown=1, NotChecked=0, Total=342 [2025-03-08 16:30:37,573 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 185 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:37,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 496 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:30:37,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-08 16:30:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 387. [2025-03-08 16:30:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 321 states have (on average 1.280373831775701) internal successors, (411), 324 states have internal predecessors, (411), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 527 transitions. [2025-03-08 16:30:37,599 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 527 transitions. Word has length 137 [2025-03-08 16:30:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:37,599 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 527 transitions. [2025-03-08 16:30:37,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:30:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 527 transitions. [2025-03-08 16:30:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:30:37,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:37,602 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:37,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:30:37,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:37,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:37,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:37,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2117131130, now seen corresponding path program 1 times [2025-03-08 16:30:37,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:37,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912630642] [2025-03-08 16:30:37,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:37,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:37,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:30:37,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:30:37,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:37,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:38,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:38,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912630642] [2025-03-08 16:30:38,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912630642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:38,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:38,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:30:38,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187803624] [2025-03-08 16:30:38,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:38,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:30:38,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:38,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:30:38,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:30:38,784 INFO L87 Difference]: Start difference. First operand 387 states and 527 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:39,211 INFO L93 Difference]: Finished difference Result 881 states and 1206 transitions. [2025-03-08 16:30:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:30:39,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-03-08 16:30:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:39,215 INFO L225 Difference]: With dead ends: 881 [2025-03-08 16:30:39,217 INFO L226 Difference]: Without dead ends: 611 [2025-03-08 16:30:39,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:30:39,219 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 122 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:39,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 748 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:30:39,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-08 16:30:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 451. [2025-03-08 16:30:39,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 385 states have (on average 1.2935064935064935) internal successors, (498), 388 states have internal predecessors, (498), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:39,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 614 transitions. [2025-03-08 16:30:39,263 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 614 transitions. Word has length 138 [2025-03-08 16:30:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:39,264 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 614 transitions. [2025-03-08 16:30:39,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 614 transitions. [2025-03-08 16:30:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:30:39,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:39,265 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:39,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:30:39,265 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:39,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash 370381703, now seen corresponding path program 1 times [2025-03-08 16:30:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:39,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213819326] [2025-03-08 16:30:39,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:39,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:30:39,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:30:39,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:39,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213819326] [2025-03-08 16:30:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213819326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:39,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:30:39,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249774541] [2025-03-08 16:30:39,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:39,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:30:39,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:39,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:30:39,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:30:39,529 INFO L87 Difference]: Start difference. First operand 451 states and 614 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:39,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:39,733 INFO L93 Difference]: Finished difference Result 833 states and 1145 transitions. [2025-03-08 16:30:39,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:30:39,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-03-08 16:30:39,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:39,736 INFO L225 Difference]: With dead ends: 833 [2025-03-08 16:30:39,736 INFO L226 Difference]: Without dead ends: 503 [2025-03-08 16:30:39,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:30:39,737 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:39,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 371 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:30:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-08 16:30:39,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 451. [2025-03-08 16:30:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 385 states have (on average 1.283116883116883) internal successors, (494), 388 states have internal predecessors, (494), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 610 transitions. [2025-03-08 16:30:39,774 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 610 transitions. Word has length 138 [2025-03-08 16:30:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:39,775 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 610 transitions. [2025-03-08 16:30:39,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 610 transitions. [2025-03-08 16:30:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:30:39,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:39,777 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:39,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:30:39,777 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:39,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1333364295, now seen corresponding path program 1 times [2025-03-08 16:30:39,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:39,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952181836] [2025-03-08 16:30:39,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:39,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:39,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:30:39,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:30:39,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:39,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:40,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:40,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952181836] [2025-03-08 16:30:40,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952181836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:40,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:30:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775264844] [2025-03-08 16:30:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:40,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:30:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:40,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:30:40,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:30:40,017 INFO L87 Difference]: Start difference. First operand 451 states and 610 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:40,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:40,251 INFO L93 Difference]: Finished difference Result 825 states and 1133 transitions. [2025-03-08 16:30:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:30:40,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-03-08 16:30:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:40,254 INFO L225 Difference]: With dead ends: 825 [2025-03-08 16:30:40,254 INFO L226 Difference]: Without dead ends: 495 [2025-03-08 16:30:40,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:30:40,255 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 109 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:40,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 409 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:30:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-08 16:30:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 453. [2025-03-08 16:30:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 387 states have (on average 1.2713178294573644) internal successors, (492), 390 states have internal predecessors, (492), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:30:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 608 transitions. [2025-03-08 16:30:40,287 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 608 transitions. Word has length 138 [2025-03-08 16:30:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:40,287 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 608 transitions. [2025-03-08 16:30:40,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 608 transitions. [2025-03-08 16:30:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 16:30:40,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:40,288 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:40,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:30:40,288 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:40,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:40,289 INFO L85 PathProgramCache]: Analyzing trace with hash -474090168, now seen corresponding path program 1 times [2025-03-08 16:30:40,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:40,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159244530] [2025-03-08 16:30:40,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:40,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:40,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 16:30:40,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 16:30:40,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:40,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:40,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159244530] [2025-03-08 16:30:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159244530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:40,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:40,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:30:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738486555] [2025-03-08 16:30:40,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:40,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:30:40,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:40,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:30:40,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:30:40,531 INFO L87 Difference]: Start difference. First operand 453 states and 608 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:40,750 INFO L93 Difference]: Finished difference Result 857 states and 1159 transitions. [2025-03-08 16:30:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:30:40,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2025-03-08 16:30:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:40,753 INFO L225 Difference]: With dead ends: 857 [2025-03-08 16:30:40,753 INFO L226 Difference]: Without dead ends: 541 [2025-03-08 16:30:40,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:30:40,754 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 109 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:40,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 782 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:30:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-08 16:30:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2025-03-08 16:30:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 331 states have (on average 1.2628398791540785) internal successors, (418), 332 states have internal predecessors, (418), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:30:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 518 transitions. [2025-03-08 16:30:40,784 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 518 transitions. Word has length 138 [2025-03-08 16:30:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:40,784 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 518 transitions. [2025-03-08 16:30:40,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 518 transitions. [2025-03-08 16:30:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:30:40,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:40,786 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:40,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:30:40,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:40,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1857703683, now seen corresponding path program 1 times [2025-03-08 16:30:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:40,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850133365] [2025-03-08 16:30:40,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:40,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:30:40,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:30:40,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:40,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:30:40,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850133365] [2025-03-08 16:30:40,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850133365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:30:40,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791116282] [2025-03-08 16:30:40,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:40,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:40,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:30:40,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:30:40,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 16:30:41,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:30:41,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:30:41,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:41,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:41,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:30:41,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:30:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:41,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:30:41,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791116282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:41,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:30:41,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2025-03-08 16:30:41,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487126895] [2025-03-08 16:30:41,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:41,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:30:41,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:41,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:30:41,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:30:41,113 INFO L87 Difference]: Start difference. First operand 389 states and 518 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:41,156 INFO L93 Difference]: Finished difference Result 401 states and 531 transitions. [2025-03-08 16:30:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:30:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-03-08 16:30:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:41,159 INFO L225 Difference]: With dead ends: 401 [2025-03-08 16:30:41,159 INFO L226 Difference]: Without dead ends: 399 [2025-03-08 16:30:41,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:30:41,159 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:41,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 648 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:30:41,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-08 16:30:41,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-03-08 16:30:41,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 341 states have (on average 1.2551319648093842) internal successors, (428), 342 states have internal predecessors, (428), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:30:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 528 transitions. [2025-03-08 16:30:41,184 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 528 transitions. Word has length 140 [2025-03-08 16:30:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:41,185 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 528 transitions. [2025-03-08 16:30:41,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 528 transitions. [2025-03-08 16:30:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:30:41,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:41,186 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 16:30:41,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 16:30:41,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 16:30:41,387 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:41,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash 425098242, now seen corresponding path program 1 times [2025-03-08 16:30:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428112640] [2025-03-08 16:30:41,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:41,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:30:41,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:30:41,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:41,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:30:41,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:41,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428112640] [2025-03-08 16:30:41,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428112640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:30:41,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682396186] [2025-03-08 16:30:41,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:41,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:41,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:30:41,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:30:41,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 16:30:41,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:30:41,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:30:41,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:41,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:41,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 16:30:41,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:30:41,803 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:30:41,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:30:41,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682396186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:41,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:30:41,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-03-08 16:30:41,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374837455] [2025-03-08 16:30:41,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:41,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:30:41,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:41,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:30:41,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:30:41,804 INFO L87 Difference]: Start difference. First operand 399 states and 528 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:41,853 INFO L93 Difference]: Finished difference Result 413 states and 543 transitions. [2025-03-08 16:30:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:30:41,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2025-03-08 16:30:41,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:41,856 INFO L225 Difference]: With dead ends: 413 [2025-03-08 16:30:41,856 INFO L226 Difference]: Without dead ends: 411 [2025-03-08 16:30:41,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:30:41,856 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:41,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 749 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:30:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-08 16:30:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 401. [2025-03-08 16:30:41,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 343 states have (on average 1.2536443148688046) internal successors, (430), 344 states have internal predecessors, (430), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 16:30:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 530 transitions. [2025-03-08 16:30:41,881 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 530 transitions. Word has length 142 [2025-03-08 16:30:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:41,882 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 530 transitions. [2025-03-08 16:30:41,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 530 transitions. [2025-03-08 16:30:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 16:30:41,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:41,884 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 16:30:41,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 16:30:42,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 16:30:42,085 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:42,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1500482886, now seen corresponding path program 1 times [2025-03-08 16:30:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:42,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253060546] [2025-03-08 16:30:42,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:42,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 16:30:42,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 16:30:42,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:42,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 2548 trivial. 0 not checked. [2025-03-08 16:30:42,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:42,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253060546] [2025-03-08 16:30:42,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253060546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:30:42,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153516306] [2025-03-08 16:30:42,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:42,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:30:42,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:30:42,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:30:42,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 16:30:42,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 16:30:42,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:42,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:42,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 16:30:42,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:30:44,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:44,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:30:44,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2025-03-08 16:30:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 5 proven. 744 refuted. 0 times theorem prover too weak. 1826 trivial. 0 not checked. [2025-03-08 16:30:44,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:30:44,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-08 16:30:44,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153516306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:30:44,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:30:44,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2025-03-08 16:30:44,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846845983] [2025-03-08 16:30:44,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:30:44,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:30:44,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:44,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:30:44,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:30:44,595 INFO L87 Difference]: Start difference. First operand 401 states and 530 transitions. Second operand has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 4 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-08 16:30:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:44,878 INFO L93 Difference]: Finished difference Result 829 states and 1109 transitions. [2025-03-08 16:30:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:30:44,879 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 4 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) Word has length 268 [2025-03-08 16:30:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:44,881 INFO L225 Difference]: With dead ends: 829 [2025-03-08 16:30:44,881 INFO L226 Difference]: Without dead ends: 557 [2025-03-08 16:30:44,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:30:44,883 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 164 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:44,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 516 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:30:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-08 16:30:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 553. [2025-03-08 16:30:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 467 states have (on average 1.2419700214132763) internal successors, (580), 470 states have internal predecessors, (580), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:30:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 728 transitions. [2025-03-08 16:30:44,922 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 728 transitions. Word has length 268 [2025-03-08 16:30:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:44,923 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 728 transitions. [2025-03-08 16:30:44,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 4 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-08 16:30:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 728 transitions. [2025-03-08 16:30:44,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-08 16:30:44,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:44,925 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 16:30:44,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 16:30:45,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:45,126 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:45,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1183543452, now seen corresponding path program 1 times [2025-03-08 16:30:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:45,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318391477] [2025-03-08 16:30:45,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:45,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-08 16:30:45,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-08 16:30:45,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:45,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2575 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2564 trivial. 0 not checked. [2025-03-08 16:30:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318391477] [2025-03-08 16:30:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318391477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:30:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723159964] [2025-03-08 16:30:45,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:45,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:30:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:45,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:30:45,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:30:45,308 INFO L87 Difference]: Start difference. First operand 553 states and 728 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:45,440 INFO L93 Difference]: Finished difference Result 973 states and 1290 transitions. [2025-03-08 16:30:45,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:30:45,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 268 [2025-03-08 16:30:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:45,443 INFO L225 Difference]: With dead ends: 973 [2025-03-08 16:30:45,443 INFO L226 Difference]: Without dead ends: 546 [2025-03-08 16:30:45,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:30:45,448 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 31 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:45,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 591 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:30:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-08 16:30:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 541. [2025-03-08 16:30:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 455 states have (on average 1.2285714285714286) internal successors, (559), 458 states have internal predecessors, (559), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:30:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 707 transitions. [2025-03-08 16:30:45,490 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 707 transitions. Word has length 268 [2025-03-08 16:30:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:45,490 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 707 transitions. [2025-03-08 16:30:45,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 707 transitions. [2025-03-08 16:30:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 16:30:45,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:45,493 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 16:30:45,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 16:30:45,494 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:45,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1124847411, now seen corresponding path program 1 times [2025-03-08 16:30:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:45,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164821103] [2025-03-08 16:30:45,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:45,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:45,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 16:30:45,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 16:30:45,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:45,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2566 trivial. 0 not checked. [2025-03-08 16:30:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:45,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164821103] [2025-03-08 16:30:45,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164821103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:45,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:45,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:30:45,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489852506] [2025-03-08 16:30:45,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:45,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:30:45,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:45,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:30:45,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:30:45,613 INFO L87 Difference]: Start difference. First operand 541 states and 707 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:45,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:45,695 INFO L93 Difference]: Finished difference Result 1040 states and 1360 transitions. [2025-03-08 16:30:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:30:45,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 270 [2025-03-08 16:30:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:45,698 INFO L225 Difference]: With dead ends: 1040 [2025-03-08 16:30:45,698 INFO L226 Difference]: Without dead ends: 628 [2025-03-08 16:30:45,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:30:45,700 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 44 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:45,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 450 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:30:45,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-08 16:30:45,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 526. [2025-03-08 16:30:45,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 440 states have (on average 1.2227272727272727) internal successors, (538), 443 states have internal predecessors, (538), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:30:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 686 transitions. [2025-03-08 16:30:45,738 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 686 transitions. Word has length 270 [2025-03-08 16:30:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:45,739 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 686 transitions. [2025-03-08 16:30:45,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 686 transitions. [2025-03-08 16:30:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 16:30:45,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:45,742 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 16:30:45,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:30:45,743 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:45,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash 811689771, now seen corresponding path program 1 times [2025-03-08 16:30:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:45,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767840871] [2025-03-08 16:30:45,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:45,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:45,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 16:30:45,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 16:30:45,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:45,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2566 trivial. 0 not checked. [2025-03-08 16:30:45,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:45,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767840871] [2025-03-08 16:30:45,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767840871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:45,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:45,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:30:45,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395324877] [2025-03-08 16:30:45,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:45,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:30:45,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:45,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:30:45,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:30:45,847 INFO L87 Difference]: Start difference. First operand 526 states and 686 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:45,911 INFO L93 Difference]: Finished difference Result 919 states and 1206 transitions. [2025-03-08 16:30:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:30:45,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 270 [2025-03-08 16:30:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:45,916 INFO L225 Difference]: With dead ends: 919 [2025-03-08 16:30:45,916 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 16:30:45,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:30:45,918 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 28 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:45,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 409 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:30:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 16:30:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 520. [2025-03-08 16:30:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 434 states have (on average 1.2096774193548387) internal successors, (525), 437 states have internal predecessors, (525), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:30:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 673 transitions. [2025-03-08 16:30:45,969 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 673 transitions. Word has length 270 [2025-03-08 16:30:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:45,971 INFO L471 AbstractCegarLoop]: Abstraction has 520 states and 673 transitions. [2025-03-08 16:30:45,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 673 transitions. [2025-03-08 16:30:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-03-08 16:30:45,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:45,974 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 16:30:45,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:30:45,974 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:45,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash -831444404, now seen corresponding path program 1 times [2025-03-08 16:30:45,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:45,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555115433] [2025-03-08 16:30:45,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:45,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:45,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-03-08 16:30:46,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-03-08 16:30:46,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:46,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:46,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2565 trivial. 0 not checked. [2025-03-08 16:30:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:46,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555115433] [2025-03-08 16:30:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555115433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:30:46,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:30:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:30:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321901824] [2025-03-08 16:30:46,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:30:46,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:30:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:46,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:30:46,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:30:46,126 INFO L87 Difference]: Start difference. First operand 520 states and 673 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:46,245 INFO L93 Difference]: Finished difference Result 1001 states and 1294 transitions. [2025-03-08 16:30:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:30:46,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 270 [2025-03-08 16:30:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:46,249 INFO L225 Difference]: With dead ends: 1001 [2025-03-08 16:30:46,249 INFO L226 Difference]: Without dead ends: 610 [2025-03-08 16:30:46,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:30:46,250 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 43 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:46,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 606 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:30:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-08 16:30:46,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 505. [2025-03-08 16:30:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 419 states have (on average 1.1957040572792363) internal successors, (501), 422 states have internal predecessors, (501), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 71 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-08 16:30:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 649 transitions. [2025-03-08 16:30:46,307 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 649 transitions. Word has length 270 [2025-03-08 16:30:46,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:46,308 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 649 transitions. [2025-03-08 16:30:46,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:30:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 649 transitions. [2025-03-08 16:30:46,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-08 16:30:46,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:46,310 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 16:30:46,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:30:46,310 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:46,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:46,311 INFO L85 PathProgramCache]: Analyzing trace with hash 861448273, now seen corresponding path program 1 times [2025-03-08 16:30:46,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:46,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867397538] [2025-03-08 16:30:46,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:46,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:46,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 16:30:46,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 16:30:46,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:46,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:30:46,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619503901] [2025-03-08 16:30:46,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:46,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:46,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:30:46,422 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:30:46,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 16:30:46,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-08 16:30:46,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-08 16:30:46,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:46,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:46,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-08 16:30:46,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:30:48,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:48,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-08 16:30:48,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-08 16:30:49,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:30:49,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:30:50,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 16:30:50,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:50,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:30:50,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2025-03-08 16:30:51,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:51,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:51,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:30:51,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 16:30:51,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-03-08 16:30:51,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:30:51,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2025-03-08 16:30:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 6 proven. 1923 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-08 16:30:51,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:30:52,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:52,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867397538] [2025-03-08 16:30:52,111 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:30:52,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619503901] [2025-03-08 16:30:52,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619503901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:30:52,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:30:52,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-03-08 16:30:52,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530274960] [2025-03-08 16:30:52,111 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 16:30:52,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:30:52,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:52,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:30:52,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:30:52,112 INFO L87 Difference]: Start difference. First operand 505 states and 649 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 10 states have internal predecessors, (103), 4 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 16:30:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:53,244 INFO L93 Difference]: Finished difference Result 1752 states and 2244 transitions. [2025-03-08 16:30:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:30:53,244 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 10 states have internal predecessors, (103), 4 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 271 [2025-03-08 16:30:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:53,250 INFO L225 Difference]: With dead ends: 1752 [2025-03-08 16:30:53,250 INFO L226 Difference]: Without dead ends: 1376 [2025-03-08 16:30:53,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-08 16:30:53,253 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 476 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:53,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 613 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:30:53,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-08 16:30:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1130. [2025-03-08 16:30:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 939 states have (on average 1.1863684771033014) internal successors, (1114), 949 states have internal predecessors, (1114), 162 states have call successors, (162), 28 states have call predecessors, (162), 28 states have return successors, (162), 152 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-08 16:30:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1438 transitions. [2025-03-08 16:30:53,349 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1438 transitions. Word has length 271 [2025-03-08 16:30:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:53,350 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1438 transitions. [2025-03-08 16:30:53,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 10 states have internal predecessors, (103), 4 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2025-03-08 16:30:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1438 transitions. [2025-03-08 16:30:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 16:30:53,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:53,352 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 16:30:53,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 16:30:53,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:53,557 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:53,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:53,557 INFO L85 PathProgramCache]: Analyzing trace with hash 210550626, now seen corresponding path program 1 times [2025-03-08 16:30:53,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:53,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726790453] [2025-03-08 16:30:53,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:53,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:53,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 16:30:53,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 16:30:53,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:53,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:30:53,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1762788807] [2025-03-08 16:30:53,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:53,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:30:53,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:30:53,722 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:30:53,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 16:30:53,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 16:30:54,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 16:30:54,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:54,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:30:54,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 16:30:54,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:30:55,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:30:55,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-08 16:30:56,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:56,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 16:30:57,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-03-08 16:30:57,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:30:57,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2025-03-08 16:30:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 6 proven. 1634 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2025-03-08 16:30:57,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:30:57,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:30:57,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726790453] [2025-03-08 16:30:57,588 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 16:30:57,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762788807] [2025-03-08 16:30:57,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762788807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:30:57,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:30:57,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-08 16:30:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925975298] [2025-03-08 16:30:57,588 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 16:30:57,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:30:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:30:57,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:30:57,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:30:57,589 INFO L87 Difference]: Start difference. First operand 1130 states and 1438 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-08 16:30:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:30:58,230 INFO L93 Difference]: Finished difference Result 2315 states and 2936 transitions. [2025-03-08 16:30:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:30:58,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) Word has length 272 [2025-03-08 16:30:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:30:58,235 INFO L225 Difference]: With dead ends: 2315 [2025-03-08 16:30:58,235 INFO L226 Difference]: Without dead ends: 1332 [2025-03-08 16:30:58,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:30:58,237 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 290 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:30:58,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 498 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:30:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-03-08 16:30:58,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1144. [2025-03-08 16:30:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 953 states have (on average 1.1783840503672613) internal successors, (1123), 963 states have internal predecessors, (1123), 162 states have call successors, (162), 28 states have call predecessors, (162), 28 states have return successors, (162), 152 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-08 16:30:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1447 transitions. [2025-03-08 16:30:58,363 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1447 transitions. Word has length 272 [2025-03-08 16:30:58,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:30:58,364 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1447 transitions. [2025-03-08 16:30:58,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 8 states have internal predecessors, (101), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 3 states have call predecessors, (36), 3 states have call successors, (36) [2025-03-08 16:30:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1447 transitions. [2025-03-08 16:30:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-08 16:30:58,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:30:58,366 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:30:58,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 16:30:58,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 16:30:58,567 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:30:58,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:30:58,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1421149566, now seen corresponding path program 1 times [2025-03-08 16:30:58,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:30:58,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004336242] [2025-03-08 16:30:58,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:30:58,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:30:58,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-08 16:30:58,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-08 16:30:58,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:30:58,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat