./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-p_file-12.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 7d22deea41fa59fa50d8ffe4393e1dc9de22de8468ac22621a99fafe2a1542e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:42:22,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:42:22,913 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:42:22,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:42:22,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:42:22,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:42:22,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:42:22,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:42:22,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:42:22,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:42:22,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:42:22,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:42:22,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:42:22,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:42:22,944 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:42:22,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:42:22,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:42:22,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:42:22,945 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:42:22,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:42:22,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:42:22,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:42:22,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:42:22,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:42:22,946 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 -> 7d22deea41fa59fa50d8ffe4393e1dc9de22de8468ac22621a99fafe2a1542e8 [2025-03-17 05:42:23,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:42:23,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:42:23,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:42:23,186 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:42:23,186 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:42:23,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.i [2025-03-17 05:42:24,250 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453820d87/6acfacd22689461aaa7cbd64f37ef7a8/FLAG59d8e771c [2025-03-17 05:42:24,478 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:42:24,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-12.i [2025-03-17 05:42:24,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453820d87/6acfacd22689461aaa7cbd64f37ef7a8/FLAG59d8e771c [2025-03-17 05:42:24,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/453820d87/6acfacd22689461aaa7cbd64f37ef7a8 [2025-03-17 05:42:24,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:42:24,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:42:24,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:42:24,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:42:24,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:42:24,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:42:24" (1/1) ... [2025-03-17 05:42:24,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5540f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:24, skipping insertion in model container [2025-03-17 05:42:24,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:42:24" (1/1) ... [2025-03-17 05:42:24,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:42:24,927 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-p_file-12.i[916,929] [2025-03-17 05:42:24,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:42:24,977 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:42:24,983 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-p_file-12.i[916,929] [2025-03-17 05:42:25,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:42:25,027 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:42:25,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25 WrapperNode [2025-03-17 05:42:25,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:42:25,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:42:25,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:42:25,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:42:25,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,069 INFO L138 Inliner]: procedures = 26, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2025-03-17 05:42:25,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:42:25,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:42:25,070 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:42:25,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:42:25,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,103 INFO L175 MemorySlicer]: Split 123 memory accesses to 12 slices as follows [2, 5, 6, 6, 8, 10, 23, 10, 18, 20, 7, 8]. 19 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 14 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1]. [2025-03-17 05:42:25,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:42:25,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:42:25,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:42:25,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:42:25,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (1/1) ... [2025-03-17 05:42:25,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:42:25,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:25,152 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-17 05:42:25,157 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-17 05:42:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:42:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:42:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:42:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:42:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:42:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:42:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:42:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:42:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:42:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:42:25,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:42:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:42:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:42:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:42:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:42:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:42:25,176 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:42:25,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:42:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:42:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:42:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:42:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:42:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:42:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:42:25,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:42:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:42:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:42:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:42:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:42:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:42:25,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:42:25,297 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:42:25,298 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:42:25,578 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L103: havoc property_#t~mem71#1;havoc property_#t~ite82#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite81#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem79#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite105#1;havoc property_#t~mem104#1;havoc property_#t~mem90#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short106#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem110#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short117#1;havoc property_#t~short119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1; [2025-03-17 05:42:25,608 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-17 05:42:25,608 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:42:25,615 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:42:25,616 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:42:25,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:42:25 BoogieIcfgContainer [2025-03-17 05:42:25,617 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:42:25,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:42:25,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:42:25,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:42:25,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:42:24" (1/3) ... [2025-03-17 05:42:25,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35228f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:42:25, skipping insertion in model container [2025-03-17 05:42:25,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:42:25" (2/3) ... [2025-03-17 05:42:25,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35228f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:42:25, skipping insertion in model container [2025-03-17 05:42:25,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:42:25" (3/3) ... [2025-03-17 05:42:25,623 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-12.i [2025-03-17 05:42:25,632 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:42:25,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-12.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:42:25,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:42:25,676 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;@1b3911a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:42:25,676 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:42:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 states have internal predecessors, (103), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:42:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:42:25,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:25,688 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:25,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:25,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2126730300, now seen corresponding path program 1 times [2025-03-17 05:42:25,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:25,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297471998] [2025-03-17 05:42:25,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:25,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:25,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:42:25,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:42:25,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:25,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:42:25,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:25,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297471998] [2025-03-17 05:42:25,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297471998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:25,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661447305] [2025-03-17 05:42:25,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:25,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:25,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:25,909 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-17 05:42:25,911 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-17 05:42:26,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:42:26,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:42:26,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:26,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:26,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:42:26,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:42:26,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:42:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661447305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:42:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:42:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924120934] [2025-03-17 05:42:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:26,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:42:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:26,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:42:26,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:42:26,131 INFO L87 Difference]: Start difference. First operand has 92 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 74 states have internal predecessors, (103), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:42:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:26,145 INFO L93 Difference]: Finished difference Result 175 states and 274 transitions. [2025-03-17 05:42:26,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:42:26,147 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2025-03-17 05:42:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:26,150 INFO L225 Difference]: With dead ends: 175 [2025-03-17 05:42:26,150 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 05:42:26,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-17 05:42:26,154 INFO L435 NwaCegarLoop]: 119 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, 119 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-17 05:42:26,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:42:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 05:42:26,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-17 05:42:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 66 states have internal predecessors, (87), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:42:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2025-03-17 05:42:26,197 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 119 transitions. Word has length 113 [2025-03-17 05:42:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:26,197 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 119 transitions. [2025-03-17 05:42:26,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:42:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 119 transitions. [2025-03-17 05:42:26,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:42:26,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:26,200 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:26,207 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-17 05:42:26,401 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-17 05:42:26,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:26,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1039840844, now seen corresponding path program 1 times [2025-03-17 05:42:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:26,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558854075] [2025-03-17 05:42:26,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:26,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:42:26,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:42:26,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:26,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:42:26,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558854075] [2025-03-17 05:42:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558854075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607612638] [2025-03-17 05:42:26,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:26,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:26,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:26,708 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-17 05:42:26,709 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-17 05:42:26,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:42:26,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:42:26,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:26,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:26,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:42:26,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:26,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:42:26,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607612638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:26,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:42:26,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:42:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983281265] [2025-03-17 05:42:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:26,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:42:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:26,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:42:26,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:42:26,905 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:26,927 INFO L93 Difference]: Finished difference Result 167 states and 237 transitions. [2025-03-17 05:42:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:42:26,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2025-03-17 05:42:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:26,930 INFO L225 Difference]: With dead ends: 167 [2025-03-17 05:42:26,931 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 05:42:26,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 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-17 05:42:26,932 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:26,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 339 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:42:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 05:42:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-17 05:42:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:42:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 118 transitions. [2025-03-17 05:42:26,942 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 118 transitions. Word has length 113 [2025-03-17 05:42:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:26,942 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 118 transitions. [2025-03-17 05:42:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 118 transitions. [2025-03-17 05:42:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:42:26,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:26,944 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:26,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:42:27,145 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-17 05:42:27,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:27,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1216963070, now seen corresponding path program 1 times [2025-03-17 05:42:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:27,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686041894] [2025-03-17 05:42:27,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:27,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:27,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:42:27,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:42:27,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:27,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:42:27,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686041894] [2025-03-17 05:42:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686041894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67674797] [2025-03-17 05:42:27,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:27,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:27,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:27,375 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-17 05:42:27,377 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-17 05:42:27,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:42:27,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:42:27,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:27,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:27,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:42:27,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:27,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:42:27,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67674797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:27,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:42:27,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:42:27,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876947976] [2025-03-17 05:42:27,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:27,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:42:27,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:27,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:42:27,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:42:27,549 INFO L87 Difference]: Start difference. First operand 84 states and 118 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:27,590 INFO L93 Difference]: Finished difference Result 170 states and 239 transitions. [2025-03-17 05:42:27,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:42:27,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2025-03-17 05:42:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:27,591 INFO L225 Difference]: With dead ends: 170 [2025-03-17 05:42:27,592 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 05:42:27,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:42:27,595 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:27,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:42:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 05:42:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-17 05:42:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.289855072463768) internal successors, (89), 69 states have internal predecessors, (89), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:42:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2025-03-17 05:42:27,601 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 115 [2025-03-17 05:42:27,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:27,602 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2025-03-17 05:42:27,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2025-03-17 05:42:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 05:42:27,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:27,603 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:27,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:42:27,803 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-17 05:42:27,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:27,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:27,804 INFO L85 PathProgramCache]: Analyzing trace with hash 730298066, now seen corresponding path program 1 times [2025-03-17 05:42:27,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:27,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093447417] [2025-03-17 05:42:27,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:27,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 05:42:27,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 05:42:27,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:27,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:28,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:28,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093447417] [2025-03-17 05:42:28,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093447417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:28,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:42:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:42:28,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759814191] [2025-03-17 05:42:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:28,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:42:28,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:28,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:42:28,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:42:28,629 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:42:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:28,985 INFO L93 Difference]: Finished difference Result 160 states and 217 transitions. [2025-03-17 05:42:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:42:28,986 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 117 [2025-03-17 05:42:28,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:28,987 INFO L225 Difference]: With dead ends: 160 [2025-03-17 05:42:28,987 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 05:42:28,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:42:28,989 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 179 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:28,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 914 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:42:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 05:42:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2025-03-17 05:42:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 123 states have internal predecessors, (153), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:42:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 213 transitions. [2025-03-17 05:42:29,014 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 213 transitions. Word has length 117 [2025-03-17 05:42:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:29,014 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 213 transitions. [2025-03-17 05:42:29,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:42:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 213 transitions. [2025-03-17 05:42:29,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 05:42:29,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:29,018 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:29,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:42:29,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:29,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:29,019 INFO L85 PathProgramCache]: Analyzing trace with hash 278222224, now seen corresponding path program 1 times [2025-03-17 05:42:29,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003794939] [2025-03-17 05:42:29,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:29,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:42:29,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:42:29,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:29,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:42:30,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:30,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003794939] [2025-03-17 05:42:30,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003794939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:30,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6075174] [2025-03-17 05:42:30,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:30,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:30,330 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-17 05:42:30,332 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-17 05:42:30,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 05:42:30,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 05:42:30,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:30,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:30,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-17 05:42:30,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:30,908 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-17 05:42:31,437 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-17 05:42:31,851 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 27 treesize of output 19 [2025-03-17 05:42:31,856 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-17 05:42:32,025 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 40 treesize of output 28 [2025-03-17 05:42:32,115 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 28 proven. 326 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-17 05:42:32,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:42:32,759 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 42 treesize of output 38 [2025-03-17 05:42:33,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6075174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:33,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:42:33,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28] total 42 [2025-03-17 05:42:33,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60190522] [2025-03-17 05:42:33,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:42:33,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 05:42:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:33,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 05:42:33,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=3303, Unknown=0, NotChecked=0, Total=3660 [2025-03-17 05:42:33,573 INFO L87 Difference]: Start difference. First operand 155 states and 213 transitions. Second operand has 42 states, 34 states have (on average 2.735294117647059) internal successors, (93), 36 states have internal predecessors, (93), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-17 05:42:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:36,012 INFO L93 Difference]: Finished difference Result 287 states and 365 transitions. [2025-03-17 05:42:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-17 05:42:36,012 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 34 states have (on average 2.735294117647059) internal successors, (93), 36 states have internal predecessors, (93), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) Word has length 118 [2025-03-17 05:42:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:36,015 INFO L225 Difference]: With dead ends: 287 [2025-03-17 05:42:36,015 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 05:42:36,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 164 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1724, Invalid=9196, Unknown=0, NotChecked=0, Total=10920 [2025-03-17 05:42:36,020 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 738 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 2229 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:36,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 2337 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2229 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:42:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 05:42:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 179. [2025-03-17 05:42:36,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 140 states have (on average 1.2214285714285715) internal successors, (171), 141 states have internal predecessors, (171), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:42:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 231 transitions. [2025-03-17 05:42:36,044 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 231 transitions. Word has length 118 [2025-03-17 05:42:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:36,045 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 231 transitions. [2025-03-17 05:42:36,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 34 states have (on average 2.735294117647059) internal successors, (93), 36 states have internal predecessors, (93), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-17 05:42:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 231 transitions. [2025-03-17 05:42:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 05:42:36,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:36,048 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:36,054 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-17 05:42:36,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:36,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:36,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash -547335141, now seen corresponding path program 1 times [2025-03-17 05:42:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:36,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443544266] [2025-03-17 05:42:36,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:36,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:42:36,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:42:36,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:36,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 108 proven. 36 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 05:42:37,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:37,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443544266] [2025-03-17 05:42:37,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443544266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:37,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351791977] [2025-03-17 05:42:37,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:37,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:37,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:37,437 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-17 05:42:37,440 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-17 05:42:37,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 05:42:37,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 05:42:37,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:37,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:37,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-17 05:42:37,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:37,878 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-17 05:42:38,292 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-17 05:42:38,600 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 25 treesize of output 17 [2025-03-17 05:42:38,602 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-17 05:42:38,748 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 52 treesize of output 40 [2025-03-17 05:42:38,751 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 40 treesize of output 28 [2025-03-17 05:42:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 28 proven. 326 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-17 05:42:38,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:42:39,440 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 42 treesize of output 38 [2025-03-17 05:42:40,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351791977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:40,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:42:40,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 29] total 44 [2025-03-17 05:42:40,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120352104] [2025-03-17 05:42:40,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:42:40,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-17 05:42:40,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:40,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-17 05:42:40,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3544, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 05:42:40,310 INFO L87 Difference]: Start difference. First operand 179 states and 231 transitions. Second operand has 44 states, 36 states have (on average 2.638888888888889) internal successors, (95), 38 states have internal predecessors, (95), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-17 05:42:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:42,114 INFO L93 Difference]: Finished difference Result 219 states and 274 transitions. [2025-03-17 05:42:42,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-17 05:42:42,116 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 36 states have (on average 2.638888888888889) internal successors, (95), 38 states have internal predecessors, (95), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) Word has length 119 [2025-03-17 05:42:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:42,117 INFO L225 Difference]: With dead ends: 219 [2025-03-17 05:42:42,117 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 05:42:42,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 165 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2228 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1522, Invalid=7984, Unknown=0, NotChecked=0, Total=9506 [2025-03-17 05:42:42,119 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 616 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:42,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1879 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:42:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 05:42:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 184. [2025-03-17 05:42:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 144 states have (on average 1.2152777777777777) internal successors, (175), 145 states have internal predecessors, (175), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:42:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2025-03-17 05:42:42,133 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 119 [2025-03-17 05:42:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:42,133 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2025-03-17 05:42:42,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 36 states have (on average 2.638888888888889) internal successors, (95), 38 states have internal predecessors, (95), 11 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 9 states have call predecessors, (32), 11 states have call successors, (32) [2025-03-17 05:42:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2025-03-17 05:42:42,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:42:42,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:42,134 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:42,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:42:42,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:42,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:42,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1390575190, now seen corresponding path program 1 times [2025-03-17 05:42:42,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:42,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362794536] [2025-03-17 05:42:42,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:42,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:42,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:42:42,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:42:42,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:42,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:42,579 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:42:42,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:42,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362794536] [2025-03-17 05:42:42,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362794536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:42,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395353612] [2025-03-17 05:42:42,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:42,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:42,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:42,582 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-17 05:42:42,584 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-17 05:42:42,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:42:42,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:42:42,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:42,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:42,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:42:42,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:42,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:42:42,887 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 35 treesize of output 23 [2025-03-17 05:42:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 10 proven. 250 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:42:42,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:42:43,056 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 27 treesize of output 23 [2025-03-17 05:42:43,086 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:42:43,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395353612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:42:43,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:42:43,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-17 05:42:43,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102790839] [2025-03-17 05:42:43,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:42:43,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:42:43,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:43,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:42:43,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:42:43,088 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 13 states have internal predecessors, (59), 6 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 4 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-17 05:42:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:43,300 INFO L93 Difference]: Finished difference Result 383 states and 483 transitions. [2025-03-17 05:42:43,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:42:43,301 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 13 states have internal predecessors, (59), 6 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 4 states have call predecessors, (33), 6 states have call successors, (33) Word has length 120 [2025-03-17 05:42:43,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:43,302 INFO L225 Difference]: With dead ends: 383 [2025-03-17 05:42:43,302 INFO L226 Difference]: Without dead ends: 200 [2025-03-17 05:42:43,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 236 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:42:43,303 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 218 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:43,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 418 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:42:43,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-17 05:42:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2025-03-17 05:42:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 150 states have (on average 1.2) internal successors, (180), 151 states have internal predecessors, (180), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:42:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 240 transitions. [2025-03-17 05:42:43,320 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 240 transitions. Word has length 120 [2025-03-17 05:42:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:43,320 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 240 transitions. [2025-03-17 05:42:43,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.363636363636363) internal successors, (59), 13 states have internal predecessors, (59), 6 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 4 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-17 05:42:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 240 transitions. [2025-03-17 05:42:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-17 05:42:43,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:43,322 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:43,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:42:43,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:43,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:43,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:43,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2072675091, now seen corresponding path program 1 times [2025-03-17 05:42:43,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:43,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658369840] [2025-03-17 05:42:43,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:43,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-17 05:42:43,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-17 05:42:43,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:43,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:43,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:43,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658369840] [2025-03-17 05:42:43,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658369840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:43,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:42:43,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:42:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278292131] [2025-03-17 05:42:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:43,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:42:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:43,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:42:43,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:42:43,592 INFO L87 Difference]: Start difference. First operand 192 states and 240 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:43,632 INFO L93 Difference]: Finished difference Result 443 states and 553 transitions. [2025-03-17 05:42:43,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:42:43,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2025-03-17 05:42:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:43,634 INFO L225 Difference]: With dead ends: 443 [2025-03-17 05:42:43,634 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 05:42:43,635 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-17 05:42:43,635 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 31 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:43,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 436 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:42:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 05:42:43,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 213. [2025-03-17 05:42:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 171 states have (on average 1.1929824561403508) internal successors, (204), 172 states have internal predecessors, (204), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:42:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 264 transitions. [2025-03-17 05:42:43,649 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 264 transitions. Word has length 120 [2025-03-17 05:42:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:43,650 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 264 transitions. [2025-03-17 05:42:43,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 264 transitions. [2025-03-17 05:42:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 05:42:43,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:43,651 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:43,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:42:43,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:43,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash -787533963, now seen corresponding path program 1 times [2025-03-17 05:42:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:43,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985456209] [2025-03-17 05:42:43,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:43,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 05:42:43,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 05:42:43,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:43,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:42:43,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:43,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985456209] [2025-03-17 05:42:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985456209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034332800] [2025-03-17 05:42:43,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:43,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:43,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:43,876 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-17 05:42:43,877 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-17 05:42:43,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 05:42:44,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 05:42:44,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:44,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:44,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:42:44,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:44,066 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-17 05:42:44,199 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 35 treesize of output 23 [2025-03-17 05:42:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 10 proven. 250 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:42:44,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:42:44,366 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 27 treesize of output 23 [2025-03-17 05:42:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:42:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034332800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:42:44,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:42:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-17 05:42:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963092902] [2025-03-17 05:42:44,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:42:44,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:42:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:44,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:42:44,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:42:44,396 INFO L87 Difference]: Start difference. First operand 213 states and 264 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 6 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 4 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-17 05:42:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:44,576 INFO L93 Difference]: Finished difference Result 433 states and 535 transitions. [2025-03-17 05:42:44,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:42:44,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 6 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 4 states have call predecessors, (33), 6 states have call successors, (33) Word has length 121 [2025-03-17 05:42:44,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:44,577 INFO L225 Difference]: With dead ends: 433 [2025-03-17 05:42:44,578 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 05:42:44,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:42:44,578 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 254 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:44,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 412 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:42:44,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 05:42:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 213. [2025-03-17 05:42:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 171 states have (on average 1.1812865497076024) internal successors, (202), 172 states have internal predecessors, (202), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:42:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 262 transitions. [2025-03-17 05:42:44,605 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 262 transitions. Word has length 121 [2025-03-17 05:42:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:44,605 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 262 transitions. [2025-03-17 05:42:44,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 6 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (33), 4 states have call predecessors, (33), 6 states have call successors, (33) [2025-03-17 05:42:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 262 transitions. [2025-03-17 05:42:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:42:44,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:44,606 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:44,613 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-17 05:42:44,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:44,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:44,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1218390612, now seen corresponding path program 1 times [2025-03-17 05:42:44,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:44,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250992380] [2025-03-17 05:42:44,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:44,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:42:44,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:42:44,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:44,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:42:44,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344316624] [2025-03-17 05:42:44,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:44,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:44,868 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-17 05:42:44,870 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-17 05:42:44,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:42:45,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:42:45,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:45,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:45,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-17 05:42:45,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:45,602 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-17 05:42:45,672 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-17 05:42:46,026 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 33 treesize of output 25 [2025-03-17 05:42:46,030 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 63 treesize of output 43 [2025-03-17 05:42:46,034 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 53 treesize of output 37 [2025-03-17 05:42:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 2 proven. 254 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-17 05:42:46,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:42:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:46,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:46,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250992380] [2025-03-17 05:42:46,312 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:42:46,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344316624] [2025-03-17 05:42:46,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344316624] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:46,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:42:46,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2025-03-17 05:42:46,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442228591] [2025-03-17 05:42:46,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:46,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:42:46,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:46,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:42:46,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:42:46,313 INFO L87 Difference]: Start difference. First operand 213 states and 262 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:46,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:46,617 INFO L93 Difference]: Finished difference Result 468 states and 570 transitions. [2025-03-17 05:42:46,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:42:46,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2025-03-17 05:42:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:46,620 INFO L225 Difference]: With dead ends: 468 [2025-03-17 05:42:46,620 INFO L226 Difference]: Without dead ends: 256 [2025-03-17 05:42:46,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:42:46,621 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 108 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:46,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 488 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:42:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-17 05:42:46,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2025-03-17 05:42:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 196 states have (on average 1.153061224489796) internal successors, (226), 198 states have internal predecessors, (226), 40 states have call successors, (40), 16 states have call predecessors, (40), 16 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:42:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2025-03-17 05:42:46,651 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 122 [2025-03-17 05:42:46,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:46,652 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2025-03-17 05:42:46,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:46,652 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2025-03-17 05:42:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 05:42:46,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:46,654 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:46,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 05:42:46,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 05:42:46,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:46,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:46,856 INFO L85 PathProgramCache]: Analyzing trace with hash 997442743, now seen corresponding path program 1 times [2025-03-17 05:42:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:46,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108824437] [2025-03-17 05:42:46,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:46,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:42:46,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:42:46,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:46,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:42:46,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890066923] [2025-03-17 05:42:46,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:46,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:46,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:46,916 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-17 05:42:46,917 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-17 05:42:47,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 05:42:47,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 05:42:47,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:47,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:47,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 05:42:47,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:47,659 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-17 05:42:47,740 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-17 05:42:47,818 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 35 treesize of output 27 [2025-03-17 05:42:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-17 05:42:47,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:42:48,108 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:48,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108824437] [2025-03-17 05:42:48,108 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:42:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890066923] [2025-03-17 05:42:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890066923] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:48,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:42:48,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-03-17 05:42:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705388635] [2025-03-17 05:42:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:48,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:42:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:48,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:42:48,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:42:48,110 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:48,698 INFO L93 Difference]: Finished difference Result 561 states and 675 transitions. [2025-03-17 05:42:48,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:42:48,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 123 [2025-03-17 05:42:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:48,700 INFO L225 Difference]: With dead ends: 561 [2025-03-17 05:42:48,701 INFO L226 Difference]: Without dead ends: 345 [2025-03-17 05:42:48,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:42:48,701 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 93 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:48,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 405 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:42:48,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-03-17 05:42:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 295. [2025-03-17 05:42:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 237 states have (on average 1.160337552742616) internal successors, (275), 239 states have internal predecessors, (275), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:42:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 355 transitions. [2025-03-17 05:42:48,728 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 355 transitions. Word has length 123 [2025-03-17 05:42:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:48,728 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 355 transitions. [2025-03-17 05:42:48,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 355 transitions. [2025-03-17 05:42:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:42:48,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:48,730 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:48,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 05:42:48,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:48,933 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:48,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash -631413643, now seen corresponding path program 1 times [2025-03-17 05:42:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189212600] [2025-03-17 05:42:48,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:48,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:42:48,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:42:48,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:48,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:42:48,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924346916] [2025-03-17 05:42:48,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:48,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:48,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:48,973 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-17 05:42:48,975 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-17 05:42:49,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:42:49,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:42:49,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:49,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:49,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 05:42:49,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:49,615 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-17 05:42:49,708 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 35 treesize of output 27 [2025-03-17 05:42:49,710 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 45 treesize of output 25 [2025-03-17 05:42:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 05:42:49,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:42:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:49,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:49,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189212600] [2025-03-17 05:42:49,878 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:42:49,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924346916] [2025-03-17 05:42:49,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924346916] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:49,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:42:49,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-03-17 05:42:49,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892453367] [2025-03-17 05:42:49,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:49,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:42:49,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:49,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:42:49,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:42:49,879 INFO L87 Difference]: Start difference. First operand 295 states and 355 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:50,134 INFO L93 Difference]: Finished difference Result 640 states and 765 transitions. [2025-03-17 05:42:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:42:50,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-03-17 05:42:50,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:50,137 INFO L225 Difference]: With dead ends: 640 [2025-03-17 05:42:50,137 INFO L226 Difference]: Without dead ends: 346 [2025-03-17 05:42:50,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 235 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:42:50,138 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 116 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:50,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 520 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:42:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-17 05:42:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2025-03-17 05:42:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 267 states have (on average 1.1385767790262171) internal successors, (304), 270 states have internal predecessors, (304), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:42:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 408 transitions. [2025-03-17 05:42:50,175 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 408 transitions. Word has length 124 [2025-03-17 05:42:50,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:50,176 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 408 transitions. [2025-03-17 05:42:50,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:50,176 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 408 transitions. [2025-03-17 05:42:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 05:42:50,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:50,177 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:50,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 05:42:50,377 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,SelfDestructingSolverStorable11 [2025-03-17 05:42:50,377 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:50,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1292049653, now seen corresponding path program 1 times [2025-03-17 05:42:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:50,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318316461] [2025-03-17 05:42:50,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:50,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:42:50,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:42:50,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:50,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:42:50,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778119117] [2025-03-17 05:42:50,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:50,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:42:50,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:42:50,417 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-17 05:42:50,419 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-17 05:42:50,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 05:42:50,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 05:42:50,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:50,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:50,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:42:50,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:42:50,740 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-17 05:42:50,801 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 49 treesize of output 29 [2025-03-17 05:42:50,806 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 27 treesize of output 19 [2025-03-17 05:42:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-17 05:42:50,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:42:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:50,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:50,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318316461] [2025-03-17 05:42:50,944 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:42:50,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778119117] [2025-03-17 05:42:50,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778119117] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:42:50,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:42:50,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-17 05:42:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391821489] [2025-03-17 05:42:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:50,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:42:50,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:50,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:42:50,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:42:50,945 INFO L87 Difference]: Start difference. First operand 343 states and 408 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:51,190 INFO L93 Difference]: Finished difference Result 651 states and 772 transitions. [2025-03-17 05:42:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:42:51,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 124 [2025-03-17 05:42:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:51,192 INFO L225 Difference]: With dead ends: 651 [2025-03-17 05:42:51,192 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 05:42:51,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:42:51,193 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 145 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:51,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 440 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:42:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 05:42:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 301. [2025-03-17 05:42:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 239 states have (on average 1.1464435146443515) internal successors, (274), 241 states have internal predecessors, (274), 42 states have call successors, (42), 19 states have call predecessors, (42), 19 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 05:42:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 358 transitions. [2025-03-17 05:42:51,228 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 358 transitions. Word has length 124 [2025-03-17 05:42:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:51,228 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 358 transitions. [2025-03-17 05:42:51,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 358 transitions. [2025-03-17 05:42:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:42:51,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:51,229 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:51,237 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-17 05:42:51,430 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,SelfDestructingSolverStorable12 [2025-03-17 05:42:51,430 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:51,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash 193237322, now seen corresponding path program 1 times [2025-03-17 05:42:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:51,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123854653] [2025-03-17 05:42:51,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:51,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:51,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:42:51,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:42:51,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:51,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:51,558 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:51,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:51,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123854653] [2025-03-17 05:42:51,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123854653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:51,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:42:51,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:42:51,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398774071] [2025-03-17 05:42:51,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:51,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:42:51,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:51,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:42:51,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:42:51,560 INFO L87 Difference]: Start difference. First operand 301 states and 358 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:51,735 INFO L93 Difference]: Finished difference Result 833 states and 991 transitions. [2025-03-17 05:42:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:42:51,736 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:42:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:51,738 INFO L225 Difference]: With dead ends: 833 [2025-03-17 05:42:51,738 INFO L226 Difference]: Without dead ends: 533 [2025-03-17 05:42:51,739 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-17 05:42:51,739 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 91 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:51,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 541 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:42:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-17 05:42:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 381. [2025-03-17 05:42:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 304 states have (on average 1.1546052631578947) internal successors, (351), 307 states have internal predecessors, (351), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:42:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 455 transitions. [2025-03-17 05:42:51,795 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 455 transitions. Word has length 125 [2025-03-17 05:42:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:51,795 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 455 transitions. [2025-03-17 05:42:51,795 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 455 transitions. [2025-03-17 05:42:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:42:51,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:51,796 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:51,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:42:51,796 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:51,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash 260244075, now seen corresponding path program 1 times [2025-03-17 05:42:51,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:51,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324766830] [2025-03-17 05:42:51,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:51,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:42:51,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:42:51,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:51,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:52,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:52,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324766830] [2025-03-17 05:42:52,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324766830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:52,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:42:52,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:42:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436430213] [2025-03-17 05:42:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:52,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:42:52,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:52,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:42:52,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:42:52,023 INFO L87 Difference]: Start difference. First operand 381 states and 455 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:52,244 INFO L93 Difference]: Finished difference Result 967 states and 1156 transitions. [2025-03-17 05:42:52,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:42:52,245 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:42:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:52,248 INFO L225 Difference]: With dead ends: 967 [2025-03-17 05:42:52,249 INFO L226 Difference]: Without dead ends: 587 [2025-03-17 05:42:52,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:42:52,250 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 72 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:52,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 689 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:42:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-17 05:42:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 416. [2025-03-17 05:42:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 339 states have (on average 1.1651917404129795) internal successors, (395), 342 states have internal predecessors, (395), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:42:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 499 transitions. [2025-03-17 05:42:52,299 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 499 transitions. Word has length 125 [2025-03-17 05:42:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:52,300 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 499 transitions. [2025-03-17 05:42:52,300 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:52,300 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 499 transitions. [2025-03-17 05:42:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:42:52,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:52,302 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:52,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:42:52,302 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:52,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2058531345, now seen corresponding path program 1 times [2025-03-17 05:42:52,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:52,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202260558] [2025-03-17 05:42:52,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:52,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:52,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:42:52,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:42:52,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:52,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202260558] [2025-03-17 05:42:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202260558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:42:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-17 05:42:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99535936] [2025-03-17 05:42:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:54,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 05:42:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:54,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 05:42:54,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:42:54,361 INFO L87 Difference]: Start difference. First operand 416 states and 499 transitions. Second operand has 23 states, 20 states have (on average 2.4) internal successors, (48), 22 states have internal predecessors, (48), 7 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-17 05:42:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:57,331 INFO L93 Difference]: Finished difference Result 1023 states and 1224 transitions. [2025-03-17 05:42:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 05:42:57,332 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.4) internal successors, (48), 22 states have internal predecessors, (48), 7 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) Word has length 125 [2025-03-17 05:42:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:57,344 INFO L225 Difference]: With dead ends: 1023 [2025-03-17 05:42:57,344 INFO L226 Difference]: Without dead ends: 608 [2025-03-17 05:42:57,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=219, Invalid=1587, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 05:42:57,346 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 506 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:57,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1788 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:42:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-17 05:42:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 425. [2025-03-17 05:42:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 348 states have (on average 1.1695402298850575) internal successors, (407), 351 states have internal predecessors, (407), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:42:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 511 transitions. [2025-03-17 05:42:57,403 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 511 transitions. Word has length 125 [2025-03-17 05:42:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:57,403 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 511 transitions. [2025-03-17 05:42:57,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.4) internal successors, (48), 22 states have internal predecessors, (48), 7 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-17 05:42:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 511 transitions. [2025-03-17 05:42:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:42:57,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:57,404 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:57,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:42:57,404 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:57,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:57,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2039922446, now seen corresponding path program 1 times [2025-03-17 05:42:57,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:57,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522077762] [2025-03-17 05:42:57,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:57,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:57,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:42:57,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:42:57,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:57,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:57,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522077762] [2025-03-17 05:42:57,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522077762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:57,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:42:57,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:42:57,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531351761] [2025-03-17 05:42:57,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:57,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:42:57,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:57,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:42:57,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:42:57,635 INFO L87 Difference]: Start difference. First operand 425 states and 511 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:42:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:58,017 INFO L93 Difference]: Finished difference Result 1001 states and 1199 transitions. [2025-03-17 05:42:58,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:42:58,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:42:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:58,020 INFO L225 Difference]: With dead ends: 1001 [2025-03-17 05:42:58,020 INFO L226 Difference]: Without dead ends: 577 [2025-03-17 05:42:58,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:42:58,022 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 168 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:58,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 557 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:42:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-17 05:42:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 449. [2025-03-17 05:42:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 372 states have (on average 1.1666666666666667) internal successors, (434), 375 states have internal predecessors, (434), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:42:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 538 transitions. [2025-03-17 05:42:58,085 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 538 transitions. Word has length 125 [2025-03-17 05:42:58,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:58,086 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 538 transitions. [2025-03-17 05:42:58,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:42:58,086 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 538 transitions. [2025-03-17 05:42:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:42:58,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:58,087 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:58,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:42:58,087 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:58,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash 389326794, now seen corresponding path program 1 times [2025-03-17 05:42:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:58,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564220412] [2025-03-17 05:42:58,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:58,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:58,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:42:58,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:42:58,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:58,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:58,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:58,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564220412] [2025-03-17 05:42:58,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564220412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:58,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:42:58,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:42:58,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634602935] [2025-03-17 05:42:58,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:58,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:42:58,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:58,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:42:58,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:42:58,265 INFO L87 Difference]: Start difference. First operand 449 states and 538 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:58,555 INFO L93 Difference]: Finished difference Result 1025 states and 1220 transitions. [2025-03-17 05:42:58,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:42:58,556 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:42:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:58,558 INFO L225 Difference]: With dead ends: 1025 [2025-03-17 05:42:58,558 INFO L226 Difference]: Without dead ends: 577 [2025-03-17 05:42:58,559 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-17 05:42:58,560 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 77 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:58,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 543 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:42:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-17 05:42:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 449. [2025-03-17 05:42:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 372 states have (on average 1.1505376344086022) internal successors, (428), 375 states have internal predecessors, (428), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:42:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 532 transitions. [2025-03-17 05:42:58,624 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 532 transitions. Word has length 125 [2025-03-17 05:42:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:58,624 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 532 transitions. [2025-03-17 05:42:58,624 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 532 transitions. [2025-03-17 05:42:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:42:58,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:58,626 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:58,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:42:58,626 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:58,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash -436916761, now seen corresponding path program 1 times [2025-03-17 05:42:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:58,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880800326] [2025-03-17 05:42:58,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:58,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:42:58,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:42:58,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:58,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:42:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:42:59,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:42:59,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880800326] [2025-03-17 05:42:59,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880800326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:42:59,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:42:59,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:42:59,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349410162] [2025-03-17 05:42:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:42:59,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:42:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:42:59,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:42:59,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:42:59,106 INFO L87 Difference]: Start difference. First operand 449 states and 532 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:42:59,695 INFO L93 Difference]: Finished difference Result 1223 states and 1448 transitions. [2025-03-17 05:42:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:42:59,696 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:42:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:42:59,699 INFO L225 Difference]: With dead ends: 1223 [2025-03-17 05:42:59,699 INFO L226 Difference]: Without dead ends: 775 [2025-03-17 05:42:59,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:42:59,700 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 89 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:42:59,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1946 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:42:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-17 05:42:59,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 530. [2025-03-17 05:42:59,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 453 states have (on average 1.1788079470198676) internal successors, (534), 456 states have internal predecessors, (534), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:42:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 638 transitions. [2025-03-17 05:42:59,768 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 638 transitions. Word has length 125 [2025-03-17 05:42:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:42:59,769 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 638 transitions. [2025-03-17 05:42:59,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:42:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 638 transitions. [2025-03-17 05:42:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:42:59,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:42:59,771 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:42:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:42:59,771 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:42:59,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:42:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -633430266, now seen corresponding path program 1 times [2025-03-17 05:42:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:42:59,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106305687] [2025-03-17 05:42:59,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:42:59,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:42:59,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:42:59,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:42:59,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:42:59,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:00,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106305687] [2025-03-17 05:43:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106305687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:00,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:00,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:43:00,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849413597] [2025-03-17 05:43:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:00,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:43:00,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:00,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:43:00,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:43:00,079 INFO L87 Difference]: Start difference. First operand 530 states and 638 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:00,521 INFO L93 Difference]: Finished difference Result 1249 states and 1493 transitions. [2025-03-17 05:43:00,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:00,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:43:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:00,524 INFO L225 Difference]: With dead ends: 1249 [2025-03-17 05:43:00,524 INFO L226 Difference]: Without dead ends: 720 [2025-03-17 05:43:00,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:43:00,527 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 167 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:00,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 654 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-17 05:43:00,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 530. [2025-03-17 05:43:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 453 states have (on average 1.1699779249448123) internal successors, (530), 456 states have internal predecessors, (530), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 634 transitions. [2025-03-17 05:43:00,607 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 634 transitions. Word has length 125 [2025-03-17 05:43:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:00,607 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 634 transitions. [2025-03-17 05:43:00,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 634 transitions. [2025-03-17 05:43:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:00,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:00,608 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:00,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:43:00,609 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:00,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:00,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1539275115, now seen corresponding path program 1 times [2025-03-17 05:43:00,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:00,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279243597] [2025-03-17 05:43:00,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:00,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:00,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:00,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:00,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:00,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:00,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:00,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279243597] [2025-03-17 05:43:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279243597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:00,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:43:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269058921] [2025-03-17 05:43:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:00,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:43:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:00,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:43:00,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:43:00,930 INFO L87 Difference]: Start difference. First operand 530 states and 634 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:43:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:01,435 INFO L93 Difference]: Finished difference Result 1223 states and 1451 transitions. [2025-03-17 05:43:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:01,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 125 [2025-03-17 05:43:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:01,439 INFO L225 Difference]: With dead ends: 1223 [2025-03-17 05:43:01,439 INFO L226 Difference]: Without dead ends: 694 [2025-03-17 05:43:01,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:43:01,440 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 158 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:01,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 845 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-17 05:43:01,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 527. [2025-03-17 05:43:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 450 states have (on average 1.1577777777777778) internal successors, (521), 453 states have internal predecessors, (521), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:01,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 625 transitions. [2025-03-17 05:43:01,516 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 625 transitions. Word has length 125 [2025-03-17 05:43:01,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:01,517 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 625 transitions. [2025-03-17 05:43:01,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:43:01,517 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 625 transitions. [2025-03-17 05:43:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:01,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:01,518 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:01,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:43:01,518 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:01,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:01,518 INFO L85 PathProgramCache]: Analyzing trace with hash -503923514, now seen corresponding path program 1 times [2025-03-17 05:43:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:01,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835367509] [2025-03-17 05:43:01,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:01,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:01,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:01,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:01,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:01,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:01,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835367509] [2025-03-17 05:43:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835367509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:01,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:01,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:43:01,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891873974] [2025-03-17 05:43:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:01,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:43:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:01,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:43:01,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:43:01,722 INFO L87 Difference]: Start difference. First operand 527 states and 625 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:02,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:02,138 INFO L93 Difference]: Finished difference Result 1184 states and 1392 transitions. [2025-03-17 05:43:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:43:02,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:43:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:02,144 INFO L225 Difference]: With dead ends: 1184 [2025-03-17 05:43:02,144 INFO L226 Difference]: Without dead ends: 658 [2025-03-17 05:43:02,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:43:02,146 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 172 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:02,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 567 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-03-17 05:43:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 487. [2025-03-17 05:43:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 410 states have (on average 1.1560975609756097) internal successors, (474), 413 states have internal predecessors, (474), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 578 transitions. [2025-03-17 05:43:02,217 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 578 transitions. Word has length 125 [2025-03-17 05:43:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:02,217 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 578 transitions. [2025-03-17 05:43:02,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 578 transitions. [2025-03-17 05:43:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:02,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:02,218 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:02,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:43:02,218 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:02,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:02,219 INFO L85 PathProgramCache]: Analyzing trace with hash 224257129, now seen corresponding path program 1 times [2025-03-17 05:43:02,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:02,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293639650] [2025-03-17 05:43:02,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:02,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:02,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:02,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:02,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:02,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:02,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:02,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293639650] [2025-03-17 05:43:02,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293639650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:02,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:02,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:43:02,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942047197] [2025-03-17 05:43:02,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:02,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:43:02,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:02,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:43:02,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:43:02,486 INFO L87 Difference]: Start difference. First operand 487 states and 578 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:02,927 INFO L93 Difference]: Finished difference Result 1195 states and 1401 transitions. [2025-03-17 05:43:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:43:02,928 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:43:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:02,934 INFO L225 Difference]: With dead ends: 1195 [2025-03-17 05:43:02,934 INFO L226 Difference]: Without dead ends: 709 [2025-03-17 05:43:02,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:43:02,936 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 236 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:02,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 583 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-17 05:43:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 478. [2025-03-17 05:43:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 401 states have (on average 1.1371571072319202) internal successors, (456), 404 states have internal predecessors, (456), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 560 transitions. [2025-03-17 05:43:03,047 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 560 transitions. Word has length 125 [2025-03-17 05:43:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:03,048 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 560 transitions. [2025-03-17 05:43:03,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 560 transitions. [2025-03-17 05:43:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:03,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:03,049 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:03,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:43:03,049 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:03,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash 353339848, now seen corresponding path program 1 times [2025-03-17 05:43:03,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:03,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630025568] [2025-03-17 05:43:03,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:03,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:03,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:03,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:03,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:03,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:03,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:03,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630025568] [2025-03-17 05:43:03,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630025568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:03,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:03,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:43:03,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199042156] [2025-03-17 05:43:03,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:03,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:43:03,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:03,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:43:03,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:43:03,391 INFO L87 Difference]: Start difference. First operand 478 states and 560 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:03,903 INFO L93 Difference]: Finished difference Result 1120 states and 1302 transitions. [2025-03-17 05:43:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:03,904 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), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:43:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:03,906 INFO L225 Difference]: With dead ends: 1120 [2025-03-17 05:43:03,906 INFO L226 Difference]: Without dead ends: 640 [2025-03-17 05:43:03,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:43:03,907 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 234 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:03,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 671 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:03,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-17 05:43:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 478. [2025-03-17 05:43:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 401 states have (on average 1.1221945137157108) internal successors, (450), 404 states have internal predecessors, (450), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 554 transitions. [2025-03-17 05:43:03,984 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 554 transitions. Word has length 125 [2025-03-17 05:43:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:03,985 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 554 transitions. [2025-03-17 05:43:03,985 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), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 554 transitions. [2025-03-17 05:43:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:03,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:03,986 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:03,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:43:03,986 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:03,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 156826343, now seen corresponding path program 1 times [2025-03-17 05:43:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:03,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556035287] [2025-03-17 05:43:03,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:03,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:04,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:04,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:04,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556035287] [2025-03-17 05:43:04,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556035287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:04,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:04,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:43:04,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525478643] [2025-03-17 05:43:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:04,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:43:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:04,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:43:04,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:43:04,273 INFO L87 Difference]: Start difference. First operand 478 states and 554 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:43:04,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:04,743 INFO L93 Difference]: Finished difference Result 1152 states and 1336 transitions. [2025-03-17 05:43:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 125 [2025-03-17 05:43:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:04,756 INFO L225 Difference]: With dead ends: 1152 [2025-03-17 05:43:04,756 INFO L226 Difference]: Without dead ends: 675 [2025-03-17 05:43:04,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:43:04,757 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 239 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:04,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 734 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:04,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-03-17 05:43:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 478. [2025-03-17 05:43:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 401 states have (on average 1.1221945137157108) internal successors, (450), 404 states have internal predecessors, (450), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 554 transitions. [2025-03-17 05:43:04,837 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 554 transitions. Word has length 125 [2025-03-17 05:43:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:04,837 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 554 transitions. [2025-03-17 05:43:04,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:43:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 554 transitions. [2025-03-17 05:43:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:04,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:04,838 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:04,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:43:04,838 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:04,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1965435572, now seen corresponding path program 1 times [2025-03-17 05:43:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:04,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653159126] [2025-03-17 05:43:04,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:04,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:04,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:04,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:04,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:04,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:05,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:05,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653159126] [2025-03-17 05:43:05,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653159126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:05,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:05,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:43:05,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890173405] [2025-03-17 05:43:05,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:05,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:43:05,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:05,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:43:05,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:43:05,041 INFO L87 Difference]: Start difference. First operand 478 states and 554 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:05,384 INFO L93 Difference]: Finished difference Result 1117 states and 1287 transitions. [2025-03-17 05:43:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:43:05,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 125 [2025-03-17 05:43:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:05,387 INFO L225 Difference]: With dead ends: 1117 [2025-03-17 05:43:05,387 INFO L226 Difference]: Without dead ends: 640 [2025-03-17 05:43:05,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:43:05,388 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 155 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:05,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 494 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:05,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-03-17 05:43:05,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 478. [2025-03-17 05:43:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 401 states have (on average 1.114713216957606) internal successors, (447), 404 states have internal predecessors, (447), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 551 transitions. [2025-03-17 05:43:05,465 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 551 transitions. Word has length 125 [2025-03-17 05:43:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:05,465 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 551 transitions. [2025-03-17 05:43:05,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-17 05:43:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 551 transitions. [2025-03-17 05:43:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:05,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:05,466 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:05,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:43:05,467 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:05,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2133018219, now seen corresponding path program 1 times [2025-03-17 05:43:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:05,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016014198] [2025-03-17 05:43:05,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:05,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:05,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:05,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:05,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:05,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:05,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:05,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016014198] [2025-03-17 05:43:05,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016014198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:05,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:05,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:43:05,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521278783] [2025-03-17 05:43:05,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:05,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:43:05,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:05,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:43:05,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:43:05,935 INFO L87 Difference]: Start difference. First operand 478 states and 551 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:06,475 INFO L93 Difference]: Finished difference Result 1156 states and 1326 transitions. [2025-03-17 05:43:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:43:06,475 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:43:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:06,478 INFO L225 Difference]: With dead ends: 1156 [2025-03-17 05:43:06,478 INFO L226 Difference]: Without dead ends: 679 [2025-03-17 05:43:06,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:43:06,479 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 69 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:06,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1919 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-17 05:43:06,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 517. [2025-03-17 05:43:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 440 states have (on average 1.1181818181818182) internal successors, (492), 443 states have internal predecessors, (492), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 596 transitions. [2025-03-17 05:43:06,563 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 596 transitions. Word has length 125 [2025-03-17 05:43:06,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:06,563 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 596 transitions. [2025-03-17 05:43:06,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:06,563 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 596 transitions. [2025-03-17 05:43:06,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:06,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:06,564 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:06,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:43:06,564 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:06,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:06,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2094942324, now seen corresponding path program 1 times [2025-03-17 05:43:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:06,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523425295] [2025-03-17 05:43:06,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:06,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:06,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:06,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:06,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:06,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:06,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523425295] [2025-03-17 05:43:06,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523425295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:06,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:06,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:43:06,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91471135] [2025-03-17 05:43:06,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:06,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:43:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:06,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:43:06,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:43:06,781 INFO L87 Difference]: Start difference. First operand 517 states and 596 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:07,053 INFO L93 Difference]: Finished difference Result 1233 states and 1415 transitions. [2025-03-17 05:43:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:43:07,053 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:43:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:07,056 INFO L225 Difference]: With dead ends: 1233 [2025-03-17 05:43:07,056 INFO L226 Difference]: Without dead ends: 714 [2025-03-17 05:43:07,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:43:07,057 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 75 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:07,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 682 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-17 05:43:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 528. [2025-03-17 05:43:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 451 states have (on average 1.1197339246119733) internal successors, (505), 454 states have internal predecessors, (505), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 609 transitions. [2025-03-17 05:43:07,154 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 609 transitions. Word has length 125 [2025-03-17 05:43:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:07,154 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 609 transitions. [2025-03-17 05:43:07,154 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 609 transitions. [2025-03-17 05:43:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:07,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:07,155 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:07,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:43:07,155 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:07,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:07,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1502864136, now seen corresponding path program 1 times [2025-03-17 05:43:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:07,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103007479] [2025-03-17 05:43:07,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:07,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:07,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:07,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:07,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:07,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:07,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:07,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103007479] [2025-03-17 05:43:07,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103007479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:07,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:07,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:43:07,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478161739] [2025-03-17 05:43:07,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:07,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:43:07,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:07,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:43:07,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:43:07,673 INFO L87 Difference]: Start difference. First operand 528 states and 609 transitions. Second operand has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 05:43:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:08,066 INFO L93 Difference]: Finished difference Result 1019 states and 1175 transitions. [2025-03-17 05:43:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:08,067 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) Word has length 125 [2025-03-17 05:43:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:08,069 INFO L225 Difference]: With dead ends: 1019 [2025-03-17 05:43:08,069 INFO L226 Difference]: Without dead ends: 492 [2025-03-17 05:43:08,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:43:08,070 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 170 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:08,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 399 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-17 05:43:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-03-17 05:43:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 415 states have (on average 1.1132530120481927) internal successors, (462), 418 states have internal predecessors, (462), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 566 transitions. [2025-03-17 05:43:08,155 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 566 transitions. Word has length 125 [2025-03-17 05:43:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:08,156 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 566 transitions. [2025-03-17 05:43:08,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 8 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16) [2025-03-17 05:43:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 566 transitions. [2025-03-17 05:43:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:08,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:08,156 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:08,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:43:08,157 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:08,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash -540334493, now seen corresponding path program 1 times [2025-03-17 05:43:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760331316] [2025-03-17 05:43:08,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:08,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:08,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:08,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:08,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:08,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:08,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760331316] [2025-03-17 05:43:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760331316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:08,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:43:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412217869] [2025-03-17 05:43:08,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:08,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:43:08,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:08,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:43:08,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:43:08,607 INFO L87 Difference]: Start difference. First operand 492 states and 566 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:09,110 INFO L93 Difference]: Finished difference Result 1142 states and 1308 transitions. [2025-03-17 05:43:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 05:43:09,110 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 125 [2025-03-17 05:43:09,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:09,113 INFO L225 Difference]: With dead ends: 1142 [2025-03-17 05:43:09,113 INFO L226 Difference]: Without dead ends: 651 [2025-03-17 05:43:09,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:43:09,114 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 80 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:09,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1784 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-03-17 05:43:09,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 489. [2025-03-17 05:43:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 412 states have (on average 1.1140776699029127) internal successors, (459), 415 states have internal predecessors, (459), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 563 transitions. [2025-03-17 05:43:09,203 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 563 transitions. Word has length 125 [2025-03-17 05:43:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:09,204 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 563 transitions. [2025-03-17 05:43:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 563 transitions. [2025-03-17 05:43:09,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-17 05:43:09,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:09,205 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 05:43:09,205 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:09,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1435857383, now seen corresponding path program 1 times [2025-03-17 05:43:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286487708] [2025-03-17 05:43:09,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:09,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:09,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 05:43:09,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 05:43:09,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:09,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:09,454 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:09,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:09,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286487708] [2025-03-17 05:43:09,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286487708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:09,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:09,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:43:09,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198361995] [2025-03-17 05:43:09,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:09,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:43:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:09,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:43:09,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:43:09,456 INFO L87 Difference]: Start difference. First operand 489 states and 563 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:43:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:09,894 INFO L93 Difference]: Finished difference Result 1097 states and 1255 transitions. [2025-03-17 05:43:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 125 [2025-03-17 05:43:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:09,897 INFO L225 Difference]: With dead ends: 1097 [2025-03-17 05:43:09,897 INFO L226 Difference]: Without dead ends: 609 [2025-03-17 05:43:09,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:43:09,898 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 144 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:09,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 842 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-03-17 05:43:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 465. [2025-03-17 05:43:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 388 states have (on average 1.1005154639175259) internal successors, (427), 391 states have internal predecessors, (427), 52 states have call successors, (52), 24 states have call predecessors, (52), 24 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:43:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 531 transitions. [2025-03-17 05:43:09,981 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 531 transitions. Word has length 125 [2025-03-17 05:43:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:09,981 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 531 transitions. [2025-03-17 05:43:09,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 05:43:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 531 transitions. [2025-03-17 05:43:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:43:09,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:09,982 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:09,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:43:09,982 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:09,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1448941585, now seen corresponding path program 1 times [2025-03-17 05:43:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:09,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789191698] [2025-03-17 05:43:09,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:09,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:10,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:10,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:10,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:10,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:10,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789191698] [2025-03-17 05:43:10,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789191698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:10,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:10,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:43:10,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780589021] [2025-03-17 05:43:10,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:10,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:43:10,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:10,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:43:10,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:43:10,485 INFO L87 Difference]: Start difference. First operand 465 states and 531 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:10,899 INFO L93 Difference]: Finished difference Result 608 states and 686 transitions. [2025-03-17 05:43:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:43:10,899 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-03-17 05:43:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:10,902 INFO L225 Difference]: With dead ends: 608 [2025-03-17 05:43:10,902 INFO L226 Difference]: Without dead ends: 606 [2025-03-17 05:43:10,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:43:10,902 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 82 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:10,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1401 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-17 05:43:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 603. [2025-03-17 05:43:11,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 505 states have (on average 1.0891089108910892) internal successors, (550), 509 states have internal predecessors, (550), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:43:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 682 transitions. [2025-03-17 05:43:11,028 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 682 transitions. Word has length 128 [2025-03-17 05:43:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 603 states and 682 transitions. [2025-03-17 05:43:11,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 682 transitions. [2025-03-17 05:43:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:43:11,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:11,029 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:11,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:43:11,029 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:11,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:11,029 INFO L85 PathProgramCache]: Analyzing trace with hash -358512878, now seen corresponding path program 1 times [2025-03-17 05:43:11,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:11,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065028804] [2025-03-17 05:43:11,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:11,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:11,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:11,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:11,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:11,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065028804] [2025-03-17 05:43:11,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065028804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:11,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:43:11,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252982118] [2025-03-17 05:43:11,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:11,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:43:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:11,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:43:11,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:43:11,156 INFO L87 Difference]: Start difference. First operand 603 states and 682 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:11,307 INFO L93 Difference]: Finished difference Result 1198 states and 1355 transitions. [2025-03-17 05:43:11,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:43:11,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-03-17 05:43:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:11,310 INFO L225 Difference]: With dead ends: 1198 [2025-03-17 05:43:11,310 INFO L226 Difference]: Without dead ends: 596 [2025-03-17 05:43:11,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:43:11,311 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 44 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:11,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 477 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-17 05:43:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-17 05:43:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 498 states have (on average 1.0863453815261044) internal successors, (541), 502 states have internal predecessors, (541), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:43:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 673 transitions. [2025-03-17 05:43:11,429 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 673 transitions. Word has length 128 [2025-03-17 05:43:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:11,429 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 673 transitions. [2025-03-17 05:43:11,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 673 transitions. [2025-03-17 05:43:11,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:43:11,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:11,430 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:11,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:43:11,430 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:11,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:11,431 INFO L85 PathProgramCache]: Analyzing trace with hash -628267758, now seen corresponding path program 1 times [2025-03-17 05:43:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:11,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80486957] [2025-03-17 05:43:11,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:11,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:11,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:11,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:11,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:11,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:11,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80486957] [2025-03-17 05:43:11,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80486957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:11,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:11,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:43:11,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644103689] [2025-03-17 05:43:11,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:11,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:43:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:11,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:43:11,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:43:11,548 INFO L87 Difference]: Start difference. First operand 596 states and 673 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:11,709 INFO L93 Difference]: Finished difference Result 1191 states and 1345 transitions. [2025-03-17 05:43:11,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:43:11,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-03-17 05:43:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:11,712 INFO L225 Difference]: With dead ends: 1191 [2025-03-17 05:43:11,712 INFO L226 Difference]: Without dead ends: 596 [2025-03-17 05:43:11,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:43:11,713 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 79 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:11,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 422 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-17 05:43:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2025-03-17 05:43:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 498 states have (on average 1.0843373493975903) internal successors, (540), 502 states have internal predecessors, (540), 66 states have call successors, (66), 31 states have call predecessors, (66), 31 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-17 05:43:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 672 transitions. [2025-03-17 05:43:11,820 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 672 transitions. Word has length 128 [2025-03-17 05:43:11,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:11,820 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 672 transitions. [2025-03-17 05:43:11,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 672 transitions. [2025-03-17 05:43:11,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:43:11,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:11,821 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:43:11,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:43:11,821 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:11,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1859245075, now seen corresponding path program 1 times [2025-03-17 05:43:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998549920] [2025-03-17 05:43:11,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:11,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:43:11,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:43:11,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:11,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:43:12,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:12,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998549920] [2025-03-17 05:43:12,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998549920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:12,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:43:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997398868] [2025-03-17 05:43:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:12,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:43:12,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:12,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:43:12,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:43:12,121 INFO L87 Difference]: Start difference. First operand 596 states and 672 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:12,427 INFO L93 Difference]: Finished difference Result 675 states and 773 transitions. [2025-03-17 05:43:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:43:12,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2025-03-17 05:43:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:12,429 INFO L225 Difference]: With dead ends: 675 [2025-03-17 05:43:12,429 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 05:43:12,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:43:12,430 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 96 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 2332 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:12,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 2332 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 05:43:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 05:43:12,430 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-17 05:43:12,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 05:43:12,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2025-03-17 05:43:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:12,431 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 05:43:12,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:43:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 05:43:12,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 05:43:12,433 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:43:12,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 05:43:12,436 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:12,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.