./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-87.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 e6926b4c4456cf40fd2f7cdafc9f778396b8eaa34456b24490dcf7ecaf227025 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:22:39,821 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:22:39,872 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:22:39,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:22:39,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:22:39,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:22:39,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:22:39,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:22:39,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:22:39,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:22:39,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:22:39,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:22:39,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:22:39,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:22:39,893 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:22:39,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:22:39,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:22:39,893 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:22:39,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:22:39,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:22:39,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:22:39,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:22:39,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:22:39,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:22:39,894 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:22:39,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:22:39,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:22:39,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:22:39,894 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:22:39,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:22:39,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:22:39,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:22:39,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:22:39,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:22:39,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:22:39,895 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:22:39,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:22:39,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:22:39,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:22:39,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:22:39,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:22:39,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:22:39,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:22:39,895 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 -> e6926b4c4456cf40fd2f7cdafc9f778396b8eaa34456b24490dcf7ecaf227025 [2025-03-04 01:22:40,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:22:40,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:22:40,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:22:40,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:22:40,149 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:22:40,150 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-87.i [2025-03-04 01:22:41,309 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9d8becf/e7842d916dcf487691c164d998413a76/FLAG9fbaae02e [2025-03-04 01:22:41,556 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:22:41,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-87.i [2025-03-04 01:22:41,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9d8becf/e7842d916dcf487691c164d998413a76/FLAG9fbaae02e [2025-03-04 01:22:41,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b9d8becf/e7842d916dcf487691c164d998413a76 [2025-03-04 01:22:41,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:22:41,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:22:41,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:22:41,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:22:41,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:22:41,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3173b058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41, skipping insertion in model container [2025-03-04 01:22:41,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:22:41,710 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-87.i[917,930] [2025-03-04 01:22:41,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:22:41,773 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:22:41,782 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-87.i[917,930] [2025-03-04 01:22:41,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:22:41,833 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:22:41,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41 WrapperNode [2025-03-04 01:22:41,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:22:41,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:22:41,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:22:41,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:22:41,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,881 INFO L138 Inliner]: procedures = 26, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 423 [2025-03-04 01:22:41,884 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:22:41,884 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:22:41,884 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:22:41,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:22:41,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,917 INFO L175 MemorySlicer]: Split 119 memory accesses to 5 slices as follows [2, 11, 57, 13, 36]. 48 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 2, 5, 2, 4]. The 17 writes are split as follows [0, 2, 7, 4, 4]. [2025-03-04 01:22:41,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:22:41,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:22:41,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:22:41,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:22:41,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (1/1) ... [2025-03-04 01:22:41,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:22:41,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:41,958 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-04 01:22:41,960 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-04 01:22:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:22:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:22:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:22:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:22:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:22:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:22:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:22:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:22:41,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:22:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:22:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:22:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:22:41,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:22:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:22:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:22:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:22:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:22:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:22:41,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:22:41,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:22:42,063 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:22:42,064 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:22:42,343 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L105: havoc property_#t~mem60#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite67#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~ite88#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite103#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short107#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1; [2025-03-04 01:22:42,380 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-04 01:22:42,380 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:22:42,389 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:22:42,390 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:22:42,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:22:42 BoogieIcfgContainer [2025-03-04 01:22:42,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:22:42,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:22:42,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:22:42,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:22:42,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:22:41" (1/3) ... [2025-03-04 01:22:42,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52370275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:22:42, skipping insertion in model container [2025-03-04 01:22:42,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:22:41" (2/3) ... [2025-03-04 01:22:42,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52370275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:22:42, skipping insertion in model container [2025-03-04 01:22:42,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:22:42" (3/3) ... [2025-03-04 01:22:42,397 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-87.i [2025-03-04 01:22:42,406 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:22:42,407 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-87.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:22:42,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:22:42,458 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;@6a33ea68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:22:42,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:22:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:22:42,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:42,469 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:42,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:42,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1009210463, now seen corresponding path program 1 times [2025-03-04 01:22:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:42,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500825687] [2025-03-04 01:22:42,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:42,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:42,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:42,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:42,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:42,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:22:42,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:42,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500825687] [2025-03-04 01:22:42,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500825687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:22:42,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207269071] [2025-03-04 01:22:42,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:42,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:42,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:42,713 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-04 01:22:42,715 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-04 01:22:42,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:42,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:42,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:42,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:42,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:22:42,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:22:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:22:42,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:22:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207269071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:22:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:22:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532606530] [2025-03-04 01:22:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:42,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:22:42,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:42,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:22:42,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:22:42,928 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 70 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:22:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:42,942 INFO L93 Difference]: Finished difference Result 166 states and 253 transitions. [2025-03-04 01:22:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:22:42,943 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2025-03-04 01:22:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:42,947 INFO L225 Difference]: With dead ends: 166 [2025-03-04 01:22:42,947 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 01:22:42,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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-04 01:22:42,950 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-04 01:22:42,952 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-04 01:22:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 01:22:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 01:22:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2025-03-04 01:22:42,978 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 111 [2025-03-04 01:22:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:42,979 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2025-03-04 01:22:42,979 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, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:22:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2025-03-04 01:22:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:22:42,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:42,981 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:42,988 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-04 01:22:43,182 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-04 01:22:43,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:43,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1016029293, now seen corresponding path program 1 times [2025-03-04 01:22:43,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:43,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39707994] [2025-03-04 01:22:43,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:43,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:43,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:43,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:43,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:22:43,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:43,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39707994] [2025-03-04 01:22:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39707994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:22:43,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290893114] [2025-03-04 01:22:43,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:43,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:43,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:43,526 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-04 01:22:43,528 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-04 01:22:43,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:43,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:43,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:43,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:43,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:22:43,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:22:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:43,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:22:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290893114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:43,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:22:43,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:22:43,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486266053] [2025-03-04 01:22:43,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:43,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:22:43,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:43,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:22:43,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:22:43,737 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:43,770 INFO L93 Difference]: Finished difference Result 166 states and 231 transitions. [2025-03-04 01:22:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:22:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:22:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:43,775 INFO L225 Difference]: With dead ends: 166 [2025-03-04 01:22:43,775 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 01:22:43,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:22:43,776 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:43,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:22:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 01:22:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-03-04 01:22:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2025-03-04 01:22:43,784 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 111 [2025-03-04 01:22:43,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:43,785 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2025-03-04 01:22:43,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2025-03-04 01:22:43,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:22:43,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:43,786 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:43,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:22:43,987 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,SelfDestructingSolverStorable1 [2025-03-04 01:22:43,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:43,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:43,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1471483540, now seen corresponding path program 1 times [2025-03-04 01:22:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:43,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105275697] [2025-03-04 01:22:43,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:43,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:44,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:44,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:44,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:44,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:22:44,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:44,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105275697] [2025-03-04 01:22:44,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105275697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:22:44,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031935182] [2025-03-04 01:22:44,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:44,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:44,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:44,175 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-04 01:22:44,177 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-04 01:22:44,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:44,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:44,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:44,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:44,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:22:44,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:22:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:44,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:22:44,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031935182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:44,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:22:44,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:22:44,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18624382] [2025-03-04 01:22:44,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:44,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:22:44,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:44,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:22:44,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:22:44,326 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:44,362 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2025-03-04 01:22:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:22:44,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:22:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:44,364 INFO L225 Difference]: With dead ends: 170 [2025-03-04 01:22:44,364 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 01:22:44,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:22:44,365 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:44,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 326 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:22:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 01:22:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2025-03-04 01:22:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 71 states have internal predecessors, (91), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2025-03-04 01:22:44,375 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 111 [2025-03-04 01:22:44,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:44,376 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2025-03-04 01:22:44,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2025-03-04 01:22:44,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:22:44,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:44,378 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:44,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:22:44,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:44,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:44,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1935980075, now seen corresponding path program 1 times [2025-03-04 01:22:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:44,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452896766] [2025-03-04 01:22:44,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:44,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:44,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:44,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:44,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:22:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:44,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452896766] [2025-03-04 01:22:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452896766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:22:44,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148315141] [2025-03-04 01:22:44,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:44,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:44,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:44,733 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-04 01:22:44,735 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-04 01:22:44,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:44,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:44,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:44,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:44,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:22:44,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:22:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:44,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:22:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148315141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:44,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:22:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:22:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860663484] [2025-03-04 01:22:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:44,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:22:44,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:44,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:22:44,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:22:44,890 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:44,917 INFO L93 Difference]: Finished difference Result 174 states and 239 transitions. [2025-03-04 01:22:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:22:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:22:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:44,919 INFO L225 Difference]: With dead ends: 174 [2025-03-04 01:22:44,920 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 01:22:44,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:22:44,921 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:44,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:22:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 01:22:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2025-03-04 01:22:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2025-03-04 01:22:44,931 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 111 [2025-03-04 01:22:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:44,933 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2025-03-04 01:22:44,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2025-03-04 01:22:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:22:44,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:44,936 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:44,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:22:45,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:45,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:45,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:45,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1935056554, now seen corresponding path program 1 times [2025-03-04 01:22:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:45,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109242210] [2025-03-04 01:22:45,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:45,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:45,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:45,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:45,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:45,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:22:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109242210] [2025-03-04 01:22:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109242210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:22:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734279739] [2025-03-04 01:22:45,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:45,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:45,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:45,248 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-04 01:22:45,249 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-04 01:22:45,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:22:45,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:22:45,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:45,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:45,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:22:45,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:22:45,391 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:45,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:22:45,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734279739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:45,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:22:45,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:22:45,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599593132] [2025-03-04 01:22:45,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:22:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:45,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:22:45,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:22:45,393 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:45,413 INFO L93 Difference]: Finished difference Result 177 states and 242 transitions. [2025-03-04 01:22:45,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:22:45,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2025-03-04 01:22:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:45,415 INFO L225 Difference]: With dead ends: 177 [2025-03-04 01:22:45,416 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 01:22:45,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:22:45,417 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:45,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:22:45,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 01:22:45,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 01:22:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:45,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-03-04 01:22:45,423 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 111 [2025-03-04 01:22:45,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:45,424 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-03-04 01:22:45,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-03-04 01:22:45,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:22:45,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:45,425 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:45,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:22:45,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:45,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:45,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:45,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1005939091, now seen corresponding path program 1 times [2025-03-04 01:22:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:45,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668325512] [2025-03-04 01:22:45,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:45,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:45,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:22:45,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:22:45,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:45,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:45,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:45,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668325512] [2025-03-04 01:22:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668325512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:45,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:22:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719311536] [2025-03-04 01:22:45,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:45,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:22:45,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:45,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:22:45,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:22:45,874 INFO L87 Difference]: Start difference. First operand 91 states and 123 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:45,916 INFO L93 Difference]: Finished difference Result 227 states and 308 transitions. [2025-03-04 01:22:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:22:45,916 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-04 01:22:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:45,917 INFO L225 Difference]: With dead ends: 227 [2025-03-04 01:22:45,917 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 01:22:45,918 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-04 01:22:45,918 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 53 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:45,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 433 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:22:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 01:22:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2025-03-04 01:22:45,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2025-03-04 01:22:45,925 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 113 [2025-03-04 01:22:45,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:45,925 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2025-03-04 01:22:45,927 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2025-03-04 01:22:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 01:22:45,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:45,928 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:45,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:22:45,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:45,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:45,928 INFO L85 PathProgramCache]: Analyzing trace with hash 404143562, now seen corresponding path program 1 times [2025-03-04 01:22:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:45,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099349939] [2025-03-04 01:22:45,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:45,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 01:22:45,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 01:22:45,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:45,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:46,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:46,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099349939] [2025-03-04 01:22:46,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099349939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:46,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:46,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:22:46,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486046884] [2025-03-04 01:22:46,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:46,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:22:46,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:46,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:22:46,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:22:46,279 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:46,520 INFO L93 Difference]: Finished difference Result 264 states and 358 transitions. [2025-03-04 01:22:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:22:46,520 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-04 01:22:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:46,521 INFO L225 Difference]: With dead ends: 264 [2025-03-04 01:22:46,521 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 01:22:46,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:22:46,522 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 167 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:46,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 465 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:22:46,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 01:22:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-04 01:22:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 142 states have (on average 1.3028169014084507) internal successors, (185), 143 states have internal predecessors, (185), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:22:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 217 transitions. [2025-03-04 01:22:46,530 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 217 transitions. Word has length 113 [2025-03-04 01:22:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:46,530 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 217 transitions. [2025-03-04 01:22:46,530 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 217 transitions. [2025-03-04 01:22:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:22:46,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:46,531 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:46,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:22:46,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:46,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1637551347, now seen corresponding path program 1 times [2025-03-04 01:22:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:46,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258466175] [2025-03-04 01:22:46,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:46,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:22:46,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:22:46,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:46,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:46,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:46,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258466175] [2025-03-04 01:22:46,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258466175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:46,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:46,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:22:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060500257] [2025-03-04 01:22:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:46,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:22:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:46,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:22:46,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:22:46,891 INFO L87 Difference]: Start difference. First operand 161 states and 217 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:47,175 INFO L93 Difference]: Finished difference Result 415 states and 556 transitions. [2025-03-04 01:22:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:22:47,176 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-03-04 01:22:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:47,178 INFO L225 Difference]: With dead ends: 415 [2025-03-04 01:22:47,178 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 01:22:47,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:22:47,179 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 215 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:47,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 841 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:22:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 01:22:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 186. [2025-03-04 01:22:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 158 states have internal predecessors, (198), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:22:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 250 transitions. [2025-03-04 01:22:47,190 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 250 transitions. Word has length 114 [2025-03-04 01:22:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:47,191 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 250 transitions. [2025-03-04 01:22:47,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 250 transitions. [2025-03-04 01:22:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:22:47,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:47,192 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:47,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:22:47,192 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:47,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2022829360, now seen corresponding path program 1 times [2025-03-04 01:22:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:47,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299160752] [2025-03-04 01:22:47,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:47,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:22:47,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:22:47,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:47,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:47,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299160752] [2025-03-04 01:22:47,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299160752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:47,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:47,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:22:47,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657155887] [2025-03-04 01:22:47,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:47,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:22:47,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:47,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:22:47,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:22:47,957 INFO L87 Difference]: Start difference. First operand 186 states and 250 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:48,401 INFO L93 Difference]: Finished difference Result 488 states and 651 transitions. [2025-03-04 01:22:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:22:48,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:22:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:48,403 INFO L225 Difference]: With dead ends: 488 [2025-03-04 01:22:48,403 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 01:22:48,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:22:48,403 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 147 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:48,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1063 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:22:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 01:22:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 246. [2025-03-04 01:22:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 204 states have (on average 1.25) internal successors, (255), 207 states have internal predecessors, (255), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:22:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 327 transitions. [2025-03-04 01:22:48,432 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 327 transitions. Word has length 115 [2025-03-04 01:22:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:48,433 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 327 transitions. [2025-03-04 01:22:48,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:48,433 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2025-03-04 01:22:48,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:22:48,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:48,434 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:48,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:22:48,435 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:48,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:48,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1274361267, now seen corresponding path program 1 times [2025-03-04 01:22:48,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:48,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385477730] [2025-03-04 01:22:48,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:48,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:48,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:22:48,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:22:48,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:48,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:48,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:48,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385477730] [2025-03-04 01:22:48,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385477730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:48,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:48,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:22:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864724640] [2025-03-04 01:22:48,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:48,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:22:48,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:48,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:22:48,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:22:48,651 INFO L87 Difference]: Start difference. First operand 246 states and 327 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:48,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:48,763 INFO L93 Difference]: Finished difference Result 469 states and 619 transitions. [2025-03-04 01:22:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:22:48,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:22:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:48,765 INFO L225 Difference]: With dead ends: 469 [2025-03-04 01:22:48,766 INFO L226 Difference]: Without dead ends: 231 [2025-03-04 01:22:48,766 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-04 01:22:48,767 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 68 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:48,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 361 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:22:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-04 01:22:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 203. [2025-03-04 01:22:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 171 states have (on average 1.239766081871345) internal successors, (212), 173 states have internal predecessors, (212), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:22:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2025-03-04 01:22:48,789 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 115 [2025-03-04 01:22:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:48,790 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2025-03-04 01:22:48,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2025-03-04 01:22:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:22:48,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:48,791 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:48,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:22:48,791 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:48,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2097341599, now seen corresponding path program 1 times [2025-03-04 01:22:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:48,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040589451] [2025-03-04 01:22:48,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:48,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:22:48,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:22:48,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:48,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:49,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040589451] [2025-03-04 01:22:49,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040589451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:49,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:49,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:22:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155255779] [2025-03-04 01:22:49,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:22:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:49,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:22:49,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:22:49,465 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:22:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:49,841 INFO L93 Difference]: Finished difference Result 255 states and 327 transitions. [2025-03-04 01:22:49,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:22:49,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2025-03-04 01:22:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:49,842 INFO L225 Difference]: With dead ends: 255 [2025-03-04 01:22:49,842 INFO L226 Difference]: Without dead ends: 253 [2025-03-04 01:22:49,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:22:49,843 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 215 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:49,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 401 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:22:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-04 01:22:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 220. [2025-03-04 01:22:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 188 states have (on average 1.2393617021276595) internal successors, (233), 190 states have internal predecessors, (233), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:22:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 285 transitions. [2025-03-04 01:22:49,866 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 285 transitions. Word has length 115 [2025-03-04 01:22:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:49,866 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 285 transitions. [2025-03-04 01:22:49,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:22:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 285 transitions. [2025-03-04 01:22:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:22:49,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:49,867 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:49,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:22:49,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:49,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2096418078, now seen corresponding path program 1 times [2025-03-04 01:22:49,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:49,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841494257] [2025-03-04 01:22:49,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:49,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:49,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:22:49,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:22:49,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:49,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:50,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841494257] [2025-03-04 01:22:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841494257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:50,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:50,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:22:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435353049] [2025-03-04 01:22:50,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:50,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:22:50,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:50,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:22:50,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:22:50,227 INFO L87 Difference]: Start difference. First operand 220 states and 285 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:50,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:50,331 INFO L93 Difference]: Finished difference Result 439 states and 569 transitions. [2025-03-04 01:22:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:22:50,332 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:22:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:50,333 INFO L225 Difference]: With dead ends: 439 [2025-03-04 01:22:50,333 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 01:22:50,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:22:50,334 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 129 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:50,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 394 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:22:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 01:22:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2025-03-04 01:22:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 188 states have (on average 1.2234042553191489) internal successors, (230), 190 states have internal predecessors, (230), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:22:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 282 transitions. [2025-03-04 01:22:50,354 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 282 transitions. Word has length 115 [2025-03-04 01:22:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:50,354 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 282 transitions. [2025-03-04 01:22:50,354 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 282 transitions. [2025-03-04 01:22:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:22:50,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:50,355 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:50,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:22:50,356 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:50,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1208914397, now seen corresponding path program 1 times [2025-03-04 01:22:50,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:50,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727211290] [2025-03-04 01:22:50,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:50,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:50,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:22:50,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:22:50,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:50,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:50,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:50,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727211290] [2025-03-04 01:22:50,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727211290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:50,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:50,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:22:50,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121922883] [2025-03-04 01:22:50,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:50,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:22:50,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:50,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:22:50,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:22:50,660 INFO L87 Difference]: Start difference. First operand 220 states and 282 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:50,882 INFO L93 Difference]: Finished difference Result 441 states and 564 transitions. [2025-03-04 01:22:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:22:50,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:22:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:50,884 INFO L225 Difference]: With dead ends: 441 [2025-03-04 01:22:50,884 INFO L226 Difference]: Without dead ends: 224 [2025-03-04 01:22:50,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:22:50,885 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 83 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:50,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 259 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:22:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-04 01:22:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 158. [2025-03-04 01:22:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.2428571428571429) internal successors, (174), 140 states have internal predecessors, (174), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 202 transitions. [2025-03-04 01:22:50,899 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 202 transitions. Word has length 115 [2025-03-04 01:22:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:50,899 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 202 transitions. [2025-03-04 01:22:50,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 202 transitions. [2025-03-04 01:22:50,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:22:50,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:50,901 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:50,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:22:50,901 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:50,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1278598436, now seen corresponding path program 1 times [2025-03-04 01:22:50,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:50,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840015818] [2025-03-04 01:22:50,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:50,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:50,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:22:50,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:22:50,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:50,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:51,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840015818] [2025-03-04 01:22:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840015818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:51,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:51,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:22:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928521744] [2025-03-04 01:22:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:51,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:22:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:51,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:22:51,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:22:51,045 INFO L87 Difference]: Start difference. First operand 158 states and 202 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:51,175 INFO L93 Difference]: Finished difference Result 412 states and 519 transitions. [2025-03-04 01:22:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:22:51,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-04 01:22:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:51,178 INFO L225 Difference]: With dead ends: 412 [2025-03-04 01:22:51,178 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 01:22:51,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:22:51,179 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 48 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:51,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 478 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:22:51,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 01:22:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 214. [2025-03-04 01:22:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 196 states have (on average 1.2346938775510203) internal successors, (242), 196 states have internal predecessors, (242), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 270 transitions. [2025-03-04 01:22:51,199 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 270 transitions. Word has length 115 [2025-03-04 01:22:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:51,199 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 270 transitions. [2025-03-04 01:22:51,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 270 transitions. [2025-03-04 01:22:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:22:51,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:51,200 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:51,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:22:51,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:51,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:51,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2005607990, now seen corresponding path program 1 times [2025-03-04 01:22:51,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:51,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904998493] [2025-03-04 01:22:51,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:51,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:51,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:22:51,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:22:51,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:51,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:51,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:51,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904998493] [2025-03-04 01:22:51,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904998493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:51,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:51,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:22:51,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068809541] [2025-03-04 01:22:51,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:51,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:22:51,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:51,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:22:51,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:22:51,342 INFO L87 Difference]: Start difference. First operand 214 states and 270 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:51,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:51,513 INFO L93 Difference]: Finished difference Result 560 states and 707 transitions. [2025-03-04 01:22:51,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:22:51,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-03-04 01:22:51,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:51,516 INFO L225 Difference]: With dead ends: 560 [2025-03-04 01:22:51,516 INFO L226 Difference]: Without dead ends: 349 [2025-03-04 01:22:51,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:22:51,518 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 54 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:51,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 731 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:22:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-03-04 01:22:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 252. [2025-03-04 01:22:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 234 states have (on average 1.2393162393162394) internal successors, (290), 234 states have internal predecessors, (290), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 318 transitions. [2025-03-04 01:22:51,549 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 318 transitions. Word has length 116 [2025-03-04 01:22:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:51,549 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 318 transitions. [2025-03-04 01:22:51,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 318 transitions. [2025-03-04 01:22:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:22:51,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:51,550 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:51,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:22:51,550 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:51,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash -278250307, now seen corresponding path program 1 times [2025-03-04 01:22:51,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:51,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580197062] [2025-03-04 01:22:51,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:51,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:22:51,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:22:51,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:51,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:22:52,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:52,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580197062] [2025-03-04 01:22:52,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580197062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:22:52,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953635571] [2025-03-04 01:22:52,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:52,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:52,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:52,070 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-04 01:22:52,072 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-04 01:22:52,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:22:52,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:22:52,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:52,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:52,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:22:52,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:22:52,286 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-04 01:22:52,825 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 01:22:52,825 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 1 case distinctions, treesize of input 25 treesize of output 20 [2025-03-04 01:22:52,874 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 01:22:52,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 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-04 01:22:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:22:52,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:22:53,155 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 36 treesize of output 32 [2025-03-04 01:22:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:22:53,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953635571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:22:53,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:22:53,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-04 01:22:53,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489189525] [2025-03-04 01:22:53,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:22:53,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 01:22:53,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:53,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 01:22:53,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:22:53,206 INFO L87 Difference]: Start difference. First operand 252 states and 318 transitions. Second operand has 23 states, 20 states have (on average 5.8) internal successors, (116), 21 states have internal predecessors, (116), 6 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:22:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:53,779 INFO L93 Difference]: Finished difference Result 418 states and 525 transitions. [2025-03-04 01:22:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:22:53,780 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.8) internal successors, (116), 21 states have internal predecessors, (116), 6 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 116 [2025-03-04 01:22:53,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:53,780 INFO L225 Difference]: With dead ends: 418 [2025-03-04 01:22:53,780 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 01:22:53,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=987, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 01:22:53,782 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 443 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:53,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 563 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:22:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 01:22:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2025-03-04 01:22:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 146 states have (on average 1.1712328767123288) internal successors, (171), 146 states have internal predecessors, (171), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 199 transitions. [2025-03-04 01:22:53,795 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 199 transitions. Word has length 116 [2025-03-04 01:22:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:53,795 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 199 transitions. [2025-03-04 01:22:53,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.8) internal successors, (116), 21 states have internal predecessors, (116), 6 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:22:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 199 transitions. [2025-03-04 01:22:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:22:53,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:53,796 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:53,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 01:22:53,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 01:22:53,997 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:53,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1085833179, now seen corresponding path program 1 times [2025-03-04 01:22:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904455036] [2025-03-04 01:22:53,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:53,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:54,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:22:54,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:22:54,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:54,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:54,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:54,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904455036] [2025-03-04 01:22:54,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904455036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:54,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:54,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:22:54,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574255206] [2025-03-04 01:22:54,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:54,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:22:54,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:54,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:22:54,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:22:54,622 INFO L87 Difference]: Start difference. First operand 165 states and 199 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:22:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:54,900 INFO L93 Difference]: Finished difference Result 184 states and 218 transitions. [2025-03-04 01:22:54,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:22:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-04 01:22:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:54,905 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:22:54,905 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 01:22:54,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:22:54,905 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 287 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:54,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 300 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:22:54,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 01:22:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2025-03-04 01:22:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 149 states have (on average 1.167785234899329) internal successors, (174), 149 states have internal predecessors, (174), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:22:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 202 transitions. [2025-03-04 01:22:54,921 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 202 transitions. Word has length 119 [2025-03-04 01:22:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:54,921 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 202 transitions. [2025-03-04 01:22:54,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:22:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 202 transitions. [2025-03-04 01:22:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:22:54,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:54,922 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:54,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:22:54,923 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:54,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2077552925, now seen corresponding path program 1 times [2025-03-04 01:22:54,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:54,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887179972] [2025-03-04 01:22:54,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:54,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:54,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:22:54,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:22:54,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:54,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:22:54,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [602642974] [2025-03-04 01:22:54,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:54,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:54,993 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-04 01:22:54,995 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-04 01:22:55,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:22:55,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:22:55,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:55,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:55,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 01:22:55,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:22:55,962 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 8 treesize of output 1 [2025-03-04 01:22:55,988 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-04 01:22:56,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:22:56,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2025-03-04 01:22:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:56,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:22:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887179972] [2025-03-04 01:22:56,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:22:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602642974] [2025-03-04 01:22:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602642974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:56,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:56,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:22:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829163589] [2025-03-04 01:22:56,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:56,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:22:56,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:56,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:22:56,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:22:56,137 INFO L87 Difference]: Start difference. First operand 168 states and 202 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:56,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:56,465 INFO L93 Difference]: Finished difference Result 560 states and 670 transitions. [2025-03-04 01:22:56,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:22:56,466 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2025-03-04 01:22:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:56,467 INFO L225 Difference]: With dead ends: 560 [2025-03-04 01:22:56,467 INFO L226 Difference]: Without dead ends: 395 [2025-03-04 01:22:56,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:22:56,468 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 177 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:56,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 686 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:22:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-04 01:22:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 270. [2025-03-04 01:22:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 233 states have (on average 1.1716738197424892) internal successors, (273), 233 states have internal predecessors, (273), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:22:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 329 transitions. [2025-03-04 01:22:56,507 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 329 transitions. Word has length 120 [2025-03-04 01:22:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:56,508 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 329 transitions. [2025-03-04 01:22:56,508 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 329 transitions. [2025-03-04 01:22:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:22:56,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:56,509 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:56,517 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-04 01:22:56,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:56,710 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:56,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash -60592032, now seen corresponding path program 1 times [2025-03-04 01:22:56,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:56,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197252195] [2025-03-04 01:22:56,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:56,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:22:56,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:22:56,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:56,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:22:56,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1055455976] [2025-03-04 01:22:56,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:56,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:56,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:56,775 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-04 01:22:56,777 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-04 01:22:56,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:22:56,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:22:56,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:56,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:56,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 01:22:56,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:22:56,993 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 9 treesize of output 3 [2025-03-04 01:22:57,637 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 8 treesize of output 1 [2025-03-04 01:22:57,662 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-04 01:22:57,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:22:57,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2025-03-04 01:22:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:57,790 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:22:57,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:57,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197252195] [2025-03-04 01:22:57,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:22:57,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055455976] [2025-03-04 01:22:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055455976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:22:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566404109] [2025-03-04 01:22:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:57,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:22:57,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:57,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:22:57,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:22:57,792 INFO L87 Difference]: Start difference. First operand 270 states and 329 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:58,090 INFO L93 Difference]: Finished difference Result 519 states and 620 transitions. [2025-03-04 01:22:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:22:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-04 01:22:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:58,092 INFO L225 Difference]: With dead ends: 519 [2025-03-04 01:22:58,092 INFO L226 Difference]: Without dead ends: 354 [2025-03-04 01:22:58,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:22:58,093 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 241 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:58,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 474 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:22:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-04 01:22:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 306. [2025-03-04 01:22:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 269 states have (on average 1.1672862453531598) internal successors, (314), 269 states have internal predecessors, (314), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:22:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 370 transitions. [2025-03-04 01:22:58,120 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 370 transitions. Word has length 121 [2025-03-04 01:22:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:58,120 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 370 transitions. [2025-03-04 01:22:58,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 370 transitions. [2025-03-04 01:22:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:22:58,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:58,122 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:58,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 01:22:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:58,322 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:58,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2078720993, now seen corresponding path program 1 times [2025-03-04 01:22:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:58,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709142539] [2025-03-04 01:22:58,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:58,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:22:58,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:22:58,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:58,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:22:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:22:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709142539] [2025-03-04 01:22:58,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709142539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:22:58,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:22:58,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:22:58,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079392731] [2025-03-04 01:22:58,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:22:58,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:22:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:22:58,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:22:58,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:22:58,491 INFO L87 Difference]: Start difference. First operand 306 states and 370 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:22:58,689 INFO L93 Difference]: Finished difference Result 549 states and 655 transitions. [2025-03-04 01:22:58,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:22:58,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:22:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:22:58,691 INFO L225 Difference]: With dead ends: 549 [2025-03-04 01:22:58,691 INFO L226 Difference]: Without dead ends: 384 [2025-03-04 01:22:58,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:22:58,692 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:22:58,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 707 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:22:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-04 01:22:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 344. [2025-03-04 01:22:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 307 states have (on average 1.1661237785016287) internal successors, (358), 307 states have internal predecessors, (358), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:22:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 414 transitions. [2025-03-04 01:22:58,722 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 414 transitions. Word has length 122 [2025-03-04 01:22:58,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:22:58,722 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 414 transitions. [2025-03-04 01:22:58,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:22:58,722 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 414 transitions. [2025-03-04 01:22:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:22:58,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:22:58,725 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:22:58,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:22:58,725 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:22:58,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:22:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1922843296, now seen corresponding path program 1 times [2025-03-04 01:22:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:22:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716533597] [2025-03-04 01:22:58,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:58,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:22:58,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:22:58,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:22:58,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:58,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:22:58,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055736712] [2025-03-04 01:22:58,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:22:58,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:22:58,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:22:58,785 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:22:58,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 01:22:58,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:22:59,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:22:59,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:22:59,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:22:59,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 01:22:59,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:22:59,899 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 11 [2025-03-04 01:22:59,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:22:59,950 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 27 treesize of output 15 [2025-03-04 01:22:59,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:22:59,983 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 27 treesize of output 15 [2025-03-04 01:23:00,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:23:00,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 37 [2025-03-04 01:23:00,177 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 30 treesize of output 18 [2025-03-04 01:23:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:23:00,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:23:00,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:00,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716533597] [2025-03-04 01:23:00,195 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:23:00,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055736712] [2025-03-04 01:23:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055736712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:00,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:23:00,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:23:00,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900177892] [2025-03-04 01:23:00,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:00,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:23:00,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:00,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:23:00,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:23:00,197 INFO L87 Difference]: Start difference. First operand 344 states and 414 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:23:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:00,682 INFO L93 Difference]: Finished difference Result 550 states and 656 transitions. [2025-03-04 01:23:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:23:00,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:23:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:00,685 INFO L225 Difference]: With dead ends: 550 [2025-03-04 01:23:00,685 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 01:23:00,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:23:00,685 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 168 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:00,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 332 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:23:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 01:23:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 344. [2025-03-04 01:23:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 307 states have (on average 1.1628664495114007) internal successors, (357), 307 states have internal predecessors, (357), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:23:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 413 transitions. [2025-03-04 01:23:00,722 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 413 transitions. Word has length 122 [2025-03-04 01:23:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:00,722 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 413 transitions. [2025-03-04 01:23:00,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:23:00,722 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 413 transitions. [2025-03-04 01:23:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:23:00,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:00,723 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:23:00,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 01:23:00,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:23:00,925 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:00,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash 139036960, now seen corresponding path program 1 times [2025-03-04 01:23:00,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:00,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389114374] [2025-03-04 01:23:00,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:00,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:23:00,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:23:00,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:00,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:23:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718941027] [2025-03-04 01:23:00,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:00,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:23:00,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:23:00,988 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:23:00,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 01:23:01,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:23:01,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:23:01,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:01,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:01,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-04 01:23:01,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:23:01,582 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-04 01:23:01,827 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-04 01:23:02,057 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-04 01:23:02,258 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-04 01:23:02,721 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 11 [2025-03-04 01:23:02,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:02,780 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 27 treesize of output 15 [2025-03-04 01:23:02,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:02,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:02,833 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 01:23:02,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2025-03-04 01:23:03,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:03,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:23:03,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:23:03,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 42 [2025-03-04 01:23:03,546 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 32 treesize of output 20 [2025-03-04 01:23:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:23:03,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:23:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:23:04,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389114374] [2025-03-04 01:23:04,424 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:23:04,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718941027] [2025-03-04 01:23:04,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718941027] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:23:04,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:23:04,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-04 01:23:04,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193928727] [2025-03-04 01:23:04,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:04,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:23:04,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:04,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:23:04,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:23:04,426 INFO L87 Difference]: Start difference. First operand 344 states and 413 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:23:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:04,666 INFO L93 Difference]: Finished difference Result 588 states and 699 transitions. [2025-03-04 01:23:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:23:04,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:23:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:04,669 INFO L225 Difference]: With dead ends: 588 [2025-03-04 01:23:04,669 INFO L226 Difference]: Without dead ends: 421 [2025-03-04 01:23:04,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:23:04,670 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 78 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:04,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 323 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:23:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-04 01:23:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 381. [2025-03-04 01:23:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 344 states have (on average 1.1627906976744187) internal successors, (400), 344 states have internal predecessors, (400), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:23:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 456 transitions. [2025-03-04 01:23:04,700 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 456 transitions. Word has length 122 [2025-03-04 01:23:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:04,701 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 456 transitions. [2025-03-04 01:23:04,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:23:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 456 transitions. [2025-03-04 01:23:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:23:04,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:04,703 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:23:04,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 01:23:04,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 01:23:04,907 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:04,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash -154366047, now seen corresponding path program 1 times [2025-03-04 01:23:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:04,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335274494] [2025-03-04 01:23:04,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:04,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:23:04,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:23:04,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:04,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:23:05,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:05,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335274494] [2025-03-04 01:23:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335274494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:05,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:23:05,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:23:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633251653] [2025-03-04 01:23:05,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:05,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:23:05,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:05,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:23:05,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:23:05,070 INFO L87 Difference]: Start difference. First operand 381 states and 456 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:23:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:05,224 INFO L93 Difference]: Finished difference Result 628 states and 745 transitions. [2025-03-04 01:23:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:23:05,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-04 01:23:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:05,226 INFO L225 Difference]: With dead ends: 628 [2025-03-04 01:23:05,226 INFO L226 Difference]: Without dead ends: 424 [2025-03-04 01:23:05,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:23:05,227 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 45 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:05,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 576 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:23:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-03-04 01:23:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 381. [2025-03-04 01:23:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 344 states have (on average 1.1627906976744187) internal successors, (400), 344 states have internal predecessors, (400), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:23:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 456 transitions. [2025-03-04 01:23:05,259 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 456 transitions. Word has length 122 [2025-03-04 01:23:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:05,260 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 456 transitions. [2025-03-04 01:23:05,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:23:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 456 transitions. [2025-03-04 01:23:05,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:23:05,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:05,262 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:23:05,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:23:05,262 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1494540851, now seen corresponding path program 1 times [2025-03-04 01:23:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:05,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075682148] [2025-03-04 01:23:05,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:05,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:23:05,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:23:05,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:05,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:23:06,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:06,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075682148] [2025-03-04 01:23:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075682148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:06,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:23:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:23:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586522013] [2025-03-04 01:23:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:06,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:23:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:06,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:23:06,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:23:06,021 INFO L87 Difference]: Start difference. First operand 381 states and 456 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:23:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:08,181 INFO L93 Difference]: Finished difference Result 844 states and 1005 transitions. [2025-03-04 01:23:08,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 01:23:08,182 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-03-04 01:23:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:08,184 INFO L225 Difference]: With dead ends: 844 [2025-03-04 01:23:08,184 INFO L226 Difference]: Without dead ends: 625 [2025-03-04 01:23:08,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:23:08,185 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 363 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:08,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 898 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 01:23:08,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-04 01:23:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 381. [2025-03-04 01:23:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 344 states have (on average 1.1453488372093024) internal successors, (394), 344 states have internal predecessors, (394), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:23:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 450 transitions. [2025-03-04 01:23:08,223 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 450 transitions. Word has length 124 [2025-03-04 01:23:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:08,224 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 450 transitions. [2025-03-04 01:23:08,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:23:08,224 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 450 transitions. [2025-03-04 01:23:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:23:08,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:08,225 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:23:08,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:23:08,225 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:08,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1535311757, now seen corresponding path program 1 times [2025-03-04 01:23:08,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:08,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419514446] [2025-03-04 01:23:08,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:08,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:08,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:23:08,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:23:08,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:08,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:23:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:09,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419514446] [2025-03-04 01:23:09,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419514446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:23:09,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:23:09,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:23:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548779599] [2025-03-04 01:23:09,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:23:09,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:23:09,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:23:09,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:23:09,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:23:09,027 INFO L87 Difference]: Start difference. First operand 381 states and 450 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:23:10,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-04 01:23:18,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:23,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:28,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:30,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:35,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:39,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:42,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:47,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:48,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:52,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:55,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:59,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:23:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:23:59,199 INFO L93 Difference]: Finished difference Result 756 states and 891 transitions. [2025-03-04 01:23:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:23:59,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 124 [2025-03-04 01:23:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:23:59,201 INFO L225 Difference]: With dead ends: 756 [2025-03-04 01:23:59,201 INFO L226 Difference]: Without dead ends: 525 [2025-03-04 01:23:59,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:23:59,202 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 280 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 72 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:23:59,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 600 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 722 Invalid, 7 Unknown, 0 Unchecked, 42.5s Time] [2025-03-04 01:23:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-04 01:23:59,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 381. [2025-03-04 01:23:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 344 states have (on average 1.127906976744186) internal successors, (388), 344 states have internal predecessors, (388), 28 states have call successors, (28), 8 states have call predecessors, (28), 8 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:23:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 444 transitions. [2025-03-04 01:23:59,241 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 444 transitions. Word has length 124 [2025-03-04 01:23:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:23:59,241 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 444 transitions. [2025-03-04 01:23:59,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:23:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 444 transitions. [2025-03-04 01:23:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:23:59,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:23:59,242 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:23:59,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:23:59,242 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:23:59,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:23:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1341670416, now seen corresponding path program 1 times [2025-03-04 01:23:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:23:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843281631] [2025-03-04 01:23:59,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:23:59,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:23:59,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:23:59,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:23:59,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:23:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:23:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:23:59,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843281631] [2025-03-04 01:23:59,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843281631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:23:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419606645] [2025-03-04 01:23:59,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:23:59,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:23:59,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:23:59,926 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:23:59,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 01:24:00,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:24:00,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:24:00,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:24:00,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:24:00,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 01:24:00,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:24:00,859 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-04 01:24:01,125 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 25 treesize of output 13 [2025-03-04 01:24:01,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:24:01,303 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 25 treesize of output 13 [2025-03-04 01:24:01,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:24:01,352 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 25 treesize of output 13 [2025-03-04 01:24:01,432 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 17 treesize of output 9 [2025-03-04 01:24:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 96 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-04 01:24:01,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:24:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419606645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:24:01,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:24:01,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2025-03-04 01:24:01,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799736861] [2025-03-04 01:24:01,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:24:01,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:24:01,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:24:01,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:24:01,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:24:01,619 INFO L87 Difference]: Start difference. First operand 381 states and 444 transitions. Second operand has 22 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 8 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 8 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-04 01:24:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:24:02,200 INFO L93 Difference]: Finished difference Result 521 states and 600 transitions. [2025-03-04 01:24:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:24:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 8 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 8 states have call predecessors, (28), 8 states have call successors, (28) Word has length 128 [2025-03-04 01:24:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:24:02,202 INFO L225 Difference]: With dead ends: 521 [2025-03-04 01:24:02,202 INFO L226 Difference]: Without dead ends: 219 [2025-03-04 01:24:02,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=1049, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:24:02,202 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 225 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:24:02,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 236 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:24:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-04 01:24:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2025-03-04 01:24:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 176 states have (on average 1.0568181818181819) internal successors, (186), 176 states have internal predecessors, (186), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:24:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 242 transitions. [2025-03-04 01:24:02,242 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 242 transitions. Word has length 128 [2025-03-04 01:24:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:24:02,242 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 242 transitions. [2025-03-04 01:24:02,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 8 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 8 states have call predecessors, (28), 8 states have call successors, (28) [2025-03-04 01:24:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 242 transitions. [2025-03-04 01:24:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-04 01:24:02,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:24:02,243 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-04 01:24:02,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 01:24:02,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 01:24:02,443 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:24:02,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:24:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash -832669454, now seen corresponding path program 1 times [2025-03-04 01:24:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:24:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98349755] [2025-03-04 01:24:02,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:24:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:24:02,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-04 01:24:02,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 01:24:02,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:24:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:24:02,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [65692646] [2025-03-04 01:24:02,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:24:02,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:24:02,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:24:02,547 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:24:02,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 01:24:02,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-04 01:24:03,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 01:24:03,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:24:03,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:24:03,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:24:03,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:24:03,114 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 7 treesize of output 3 [2025-03-04 01:24:03,455 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 15 treesize of output 11 [2025-03-04 01:24:03,457 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-04 01:24:03,484 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 7 treesize of output 3 [2025-03-04 01:24:03,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:24:03,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2025-03-04 01:24:03,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 10 proven. 833 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2025-03-04 01:24:03,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:24:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2025-03-04 01:24:03,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:24:03,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98349755] [2025-03-04 01:24:03,822 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:24:03,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65692646] [2025-03-04 01:24:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65692646] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:24:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:24:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:24:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681519368] [2025-03-04 01:24:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:24:03,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:24:03,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:24:03,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:24:03,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:24:03,823 INFO L87 Difference]: Start difference. First operand 215 states and 242 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:24:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:24:04,099 INFO L93 Difference]: Finished difference Result 348 states and 391 transitions. [2025-03-04 01:24:04,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:24:04,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 236 [2025-03-04 01:24:04,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:24:04,101 INFO L225 Difference]: With dead ends: 348 [2025-03-04 01:24:04,101 INFO L226 Difference]: Without dead ends: 228 [2025-03-04 01:24:04,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 463 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:24:04,102 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 17 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:24:04,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 338 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:24:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-04 01:24:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 192. [2025-03-04 01:24:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.0457516339869282) internal successors, (160), 153 states have internal predecessors, (160), 28 states have call successors, (28), 10 states have call predecessors, (28), 10 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:24:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 216 transitions. [2025-03-04 01:24:04,147 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 216 transitions. Word has length 236 [2025-03-04 01:24:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:24:04,148 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 216 transitions. [2025-03-04 01:24:04,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:24:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 216 transitions. [2025-03-04 01:24:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 01:24:04,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:24:04,149 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 01:24:04,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 01:24:04,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 01:24:04,350 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:24:04,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:24:04,350 INFO L85 PathProgramCache]: Analyzing trace with hash -83172565, now seen corresponding path program 1 times [2025-03-04 01:24:04,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:24:04,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068852109] [2025-03-04 01:24:04,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:24:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:24:04,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 01:24:04,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 01:24:04,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:24:04,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:24:04,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1733537094] [2025-03-04 01:24:04,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:24:04,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:24:04,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:24:04,455 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:24:04,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 01:24:04,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 01:24:05,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 01:24:05,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:24:05,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:24:05,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-04 01:24:05,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:24:06,533 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-04 01:24:06,961 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-04 01:24:08,435 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-04 01:24:08,514 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 11 [2025-03-04 01:24:08,996 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 19 treesize of output 11 [2025-03-04 01:24:09,234 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-04 01:24:09,461 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-04 01:24:09,669 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-04 01:24:09,855 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-04 01:24:10,235 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 11 [2025-03-04 01:24:10,237 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 11 treesize of output 7 [2025-03-04 01:24:10,270 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-04 01:24:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 10 proven. 1073 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-04 01:24:10,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:24:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2025-03-04 01:24:11,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:24:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068852109] [2025-03-04 01:24:11,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:24:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733537094] [2025-03-04 01:24:11,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733537094] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:24:11,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:24:11,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2025-03-04 01:24:11,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978234300] [2025-03-04 01:24:11,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:24:11,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:24:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:24:11,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:24:11,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:24:11,103 INFO L87 Difference]: Start difference. First operand 192 states and 216 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:24:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:24:11,543 INFO L93 Difference]: Finished difference Result 310 states and 346 transitions. [2025-03-04 01:24:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:24:11,543 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 237 [2025-03-04 01:24:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:24:11,544 INFO L225 Difference]: With dead ends: 310 [2025-03-04 01:24:11,544 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:24:11,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:24:11,545 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 15 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:24:11,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 279 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:24:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:24:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:24:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 01:24:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:24:11,546 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 237 [2025-03-04 01:24:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:24:11,546 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:24:11,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:24:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:24:11,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:24:11,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:24:11,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0