./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/memory-model/2SB.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/memory-model/2SB.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 cec14f16ae81e958645b6575cf97932d8a09e14a8eafa007b1475b8cf31c9f62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:55:27,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:55:27,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:55:27,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:55:27,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:55:27,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:55:27,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:55:27,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:55:27,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:55:27,840 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:55:27,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:55:27,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:55:27,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:55:27,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:55:27,841 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:55:27,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:55:27,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:55:27,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:55:27,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:55:27,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:55:27,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:55:27,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:55:27,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:55:27,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:55:27,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:55:27,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:55:27,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:55:27,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:55:27,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:55:27,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:55:27,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:55:27,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:55:27,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:55:27,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:55:27,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:55:27,843 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:55:27,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:55:27,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:55:27,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:55:27,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:55:27,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:55:27,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:55:27,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:55:27,844 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 -> cec14f16ae81e958645b6575cf97932d8a09e14a8eafa007b1475b8cf31c9f62 [2025-03-08 00:55:28,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:55:28,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:55:28,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:55:28,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:55:28,087 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:55:28,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memory-model/2SB.i [2025-03-08 00:55:29,201 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17219ab69/c404a077a34b4924a8ac9f6bafee897c/FLAGe510a6949 [2025-03-08 00:55:29,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:55:29,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memory-model/2SB.i [2025-03-08 00:55:29,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17219ab69/c404a077a34b4924a8ac9f6bafee897c/FLAGe510a6949 [2025-03-08 00:55:29,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17219ab69/c404a077a34b4924a8ac9f6bafee897c [2025-03-08 00:55:29,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:55:29,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:55:29,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:55:29,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:55:29,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:55:29,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:55:29" (1/1) ... [2025-03-08 00:55:29,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de55edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:29, skipping insertion in model container [2025-03-08 00:55:29,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:55:29" (1/1) ... [2025-03-08 00:55:29,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:55:29,986 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/memory-model/2SB.i[13547,13560] [2025-03-08 00:55:29,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:55:29,996 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:55:30,065 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/memory-model/2SB.i[13547,13560] [2025-03-08 00:55:30,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:55:30,078 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:55:30,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30 WrapperNode [2025-03-08 00:55:30,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:55:30,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:55:30,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:55:30,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:55:30,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,125 INFO L138 Inliner]: procedures = 27, calls = 414, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 913 [2025-03-08 00:55:30,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:55:30,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:55:30,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:55:30,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:55:30,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,169 INFO L175 MemorySlicer]: Split 310 memory accesses to 14 slices as follows [37, 3, 13, 13, 40, 10, 12, 15, 48, 10, 10, 11, 12, 76]. 25 percent of accesses are in the largest equivalence class. The 26 initializations are split as follows [0, 0, 5, 5, 0, 0, 10, 0, 0, 1, 0, 0, 5, 0]. The 117 writes are split as follows [15, 2, 2, 2, 20, 5, 1, 5, 10, 3, 5, 5, 2, 40]. [2025-03-08 00:55:30,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,169 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,195 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:55:30,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:55:30,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:55:30,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:55:30,209 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (1/1) ... [2025-03-08 00:55:30,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:55:30,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:30,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:55:30,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:55:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_write [2025-03-08 00:55:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_write [2025-03-08 00:55:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_headerT [2025-03-08 00:55:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_nondet_headerT [2025-03-08 00:55:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure stepWriteBuffer [2025-03-08 00:55:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure stepWriteBuffer [2025-03-08 00:55:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_read [2025-03-08 00:55:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_read [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 00:55:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 00:55:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 00:55:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-08 00:55:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-08 00:55:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-08 00:55:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:55:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:55:30,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-08 00:55:30,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-08 00:55:30,255 INFO L130 BoogieDeclarations]: Found specification of procedure store_buffering_2_conditions [2025-03-08 00:55:30,256 INFO L138 BoogieDeclarations]: Found implementation of procedure store_buffering_2_conditions [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 00:55:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 00:55:30,257 INFO L130 BoogieDeclarations]: Found specification of procedure initWriteBuffer [2025-03-08 00:55:30,257 INFO L138 BoogieDeclarations]: Found implementation of procedure initWriteBuffer [2025-03-08 00:55:30,257 INFO L130 BoogieDeclarations]: Found specification of procedure tso_core_fence [2025-03-08 00:55:30,257 INFO L138 BoogieDeclarations]: Found implementation of procedure tso_core_fence [2025-03-08 00:55:30,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:55:30,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:55:30,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:55:30,388 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:55:30,390 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:55:30,786 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L59: havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~mem10#1;havoc #t~mem11#1;call ULTIMATE.dealloc(~#result~0#1.base, ~#result~0#1.offset);havoc ~#result~0#1.base, ~#result~0#1.offset; [2025-03-08 00:55:30,786 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: havoc __VERIFIER_nondet_operations_#t~nondet1#1; [2025-03-08 00:55:31,084 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L47: havoc __VERIFIER_nondet_step_#t~nondet0#1; [2025-03-08 00:55:31,084 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L83: call ULTIMATE.dealloc(main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset);havoc main_~#sharedMemory~0#1.base, main_~#sharedMemory~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset);havoc main_~#wrBuffer0~0#1.base, main_~#wrBuffer0~0#1.offset;call ULTIMATE.dealloc(main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset);havoc main_~#wrBuffer1~0#1.base, main_~#wrBuffer1~0#1.offset;call ULTIMATE.dealloc(main_~#g_history~0#1.base, main_~#g_history~0#1.offset);havoc main_~#g_history~0#1.base, main_~#g_history~0#1.offset;call ULTIMATE.dealloc(main_~#global_time~0#1.base, main_~#global_time~0#1.offset);havoc main_~#global_time~0#1.base, main_~#global_time~0#1.offset;call ULTIMATE.dealloc(main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset);havoc main_~#litmus_input~0#1.base, main_~#litmus_input~0#1.offset;call ULTIMATE.dealloc(main_~#input_action~0#1.base, main_~#input_action~0#1.offset);havoc main_~#input_action~0#1.base, main_~#input_action~0#1.offset; [2025-03-08 00:55:31,122 INFO L? ?]: Removed 141 outVars from TransFormulas that were not future-live. [2025-03-08 00:55:31,123 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:55:31,137 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:55:31,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:55:31,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:55:31 BoogieIcfgContainer [2025-03-08 00:55:31,138 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:55:31,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:55:31,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:55:31,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:55:31,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:55:29" (1/3) ... [2025-03-08 00:55:31,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae73585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:55:31, skipping insertion in model container [2025-03-08 00:55:31,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:55:30" (2/3) ... [2025-03-08 00:55:31,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae73585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:55:31, skipping insertion in model container [2025-03-08 00:55:31,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:55:31" (3/3) ... [2025-03-08 00:55:31,146 INFO L128 eAbstractionObserver]: Analyzing ICFG 2SB.i [2025-03-08 00:55:31,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:55:31,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 2SB.i that has 8 procedures, 166 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-08 00:55:31,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:55:31,215 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;@37b7c596, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:55:31,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:55:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 146 states have internal predecessors, (218), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:55:31,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:31,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:31,227 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:31,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash 421490303, now seen corresponding path program 1 times [2025-03-08 00:55:31,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715445107] [2025-03-08 00:55:31,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:31,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:31,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 00:55:31,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:55:31,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:31,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:55:31,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:31,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715445107] [2025-03-08 00:55:31,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715445107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:31,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:31,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:55:31,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308439507] [2025-03-08 00:55:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:31,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:31,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:31,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:31,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:55:31,597 INFO L87 Difference]: Start difference. First operand has 166 states, 143 states have (on average 1.5244755244755244) internal successors, (218), 146 states have internal predecessors, (218), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:31,628 INFO L93 Difference]: Finished difference Result 330 states and 490 transitions. [2025-03-08 00:55:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:31,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2025-03-08 00:55:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:31,637 INFO L225 Difference]: With dead ends: 330 [2025-03-08 00:55:31,637 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 00:55:31,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:55:31,643 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:31,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 435 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:31,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 00:55:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-03-08 00:55:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.3059701492537314) internal successors, (175), 136 states have internal predecessors, (175), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2025-03-08 00:55:31,674 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 42 [2025-03-08 00:55:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:31,674 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2025-03-08 00:55:31,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2025-03-08 00:55:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:55:31,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:31,676 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:31,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:55:31,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:31,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1503754085, now seen corresponding path program 1 times [2025-03-08 00:55:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:31,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259367800] [2025-03-08 00:55:31,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:31,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:55:31,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:55:31,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:31,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:55:31,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259367800] [2025-03-08 00:55:31,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259367800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:31,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283601917] [2025-03-08 00:55:31,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:31,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:31,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:31,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:55:32,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:55:32,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:55:32,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:32,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:32,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:32,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:55:32,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:32,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283601917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:32,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:32,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:32,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395820442] [2025-03-08 00:55:32,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:32,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:32,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:32,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:32,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:32,104 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:55:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:32,130 INFO L93 Difference]: Finished difference Result 307 states and 402 transitions. [2025-03-08 00:55:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:32,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2025-03-08 00:55:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:32,132 INFO L225 Difference]: With dead ends: 307 [2025-03-08 00:55:32,132 INFO L226 Difference]: Without dead ends: 157 [2025-03-08 00:55:32,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:32,133 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:32,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-08 00:55:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-08 00:55:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 135 states have (on average 1.3037037037037038) internal successors, (176), 137 states have internal predecessors, (176), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:32,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2025-03-08 00:55:32,149 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 44 [2025-03-08 00:55:32,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:32,149 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2025-03-08 00:55:32,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:55:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2025-03-08 00:55:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:55:32,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:32,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:32,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:32,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:32,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:32,353 INFO L85 PathProgramCache]: Analyzing trace with hash -302591869, now seen corresponding path program 1 times [2025-03-08 00:55:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:32,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460304613] [2025-03-08 00:55:32,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:32,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:32,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:55:32,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:55:32,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:32,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:32,517 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:55:32,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460304613] [2025-03-08 00:55:32,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460304613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:32,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724551935] [2025-03-08 00:55:32,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:32,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:32,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:32,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:32,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:55:32,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 00:55:32,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:55:32,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:32,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:32,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:32,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:32,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:55:32,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:32,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724551935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:32,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:32,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:32,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499453168] [2025-03-08 00:55:32,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:32,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:32,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:32,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:32,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:32,727 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:55:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:32,757 INFO L93 Difference]: Finished difference Result 299 states and 389 transitions. [2025-03-08 00:55:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:32,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-08 00:55:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:32,759 INFO L225 Difference]: With dead ends: 299 [2025-03-08 00:55:32,759 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 00:55:32,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:32,760 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 6 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:32,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 391 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 00:55:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2025-03-08 00:55:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 136 states have (on average 1.3014705882352942) internal successors, (177), 138 states have internal predecessors, (177), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 205 transitions. [2025-03-08 00:55:32,776 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 205 transitions. Word has length 46 [2025-03-08 00:55:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:32,777 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 205 transitions. [2025-03-08 00:55:32,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:55:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2025-03-08 00:55:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:55:32,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:32,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:32,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 00:55:32,980 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,SelfDestructingSolverStorable2 [2025-03-08 00:55:32,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:32,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:32,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1940430982, now seen corresponding path program 1 times [2025-03-08 00:55:32,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:32,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986136480] [2025-03-08 00:55:32,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:32,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:33,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:55:33,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:55:33,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:33,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:55:33,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:33,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986136480] [2025-03-08 00:55:33,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986136480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:33,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443231217] [2025-03-08 00:55:33,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:33,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:33,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:33,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:33,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:55:33,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 00:55:33,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:55:33,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:33,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:33,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:33,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:55:33,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443231217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:33,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:33,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:33,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537707626] [2025-03-08 00:55:33,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:33,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:33,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:33,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:33,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:33,342 INFO L87 Difference]: Start difference. First operand 158 states and 205 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:55:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:33,363 INFO L93 Difference]: Finished difference Result 289 states and 377 transitions. [2025-03-08 00:55:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:33,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2025-03-08 00:55:33,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:33,366 INFO L225 Difference]: With dead ends: 289 [2025-03-08 00:55:33,366 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 00:55:33,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:33,369 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 394 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-08 00:55:33,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 394 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:33,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 00:55:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2025-03-08 00:55:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 139 states have internal predecessors, (178), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 206 transitions. [2025-03-08 00:55:33,380 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 206 transitions. Word has length 49 [2025-03-08 00:55:33,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:33,381 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 206 transitions. [2025-03-08 00:55:33,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:55:33,381 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 206 transitions. [2025-03-08 00:55:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 00:55:33,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:33,382 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:33,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:33,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:33,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:33,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1556905117, now seen corresponding path program 1 times [2025-03-08 00:55:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:33,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92190715] [2025-03-08 00:55:33,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:33,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 00:55:33,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:55:33,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:33,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:55:33,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:33,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92190715] [2025-03-08 00:55:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92190715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:33,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781083358] [2025-03-08 00:55:33,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:33,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:33,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:33,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:33,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:55:33,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 00:55:33,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:55:33,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:33,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:33,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:33,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:55:33,943 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:33,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781083358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:33,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:33,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:33,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213274304] [2025-03-08 00:55:33,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:33,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:33,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:33,944 INFO L87 Difference]: Start difference. First operand 159 states and 206 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:34,001 INFO L93 Difference]: Finished difference Result 194 states and 260 transitions. [2025-03-08 00:55:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2025-03-08 00:55:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:34,003 INFO L225 Difference]: With dead ends: 194 [2025-03-08 00:55:34,003 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 00:55:34,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:34,004 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 47 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:34,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 356 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:55:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 00:55:34,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 160. [2025-03-08 00:55:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 140 states have internal predecessors, (179), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:34,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 207 transitions. [2025-03-08 00:55:34,012 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 207 transitions. Word has length 52 [2025-03-08 00:55:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:34,012 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 207 transitions. [2025-03-08 00:55:34,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 207 transitions. [2025-03-08 00:55:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 00:55:34,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:34,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:34,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:34,214 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-08 00:55:34,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:34,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1580598961, now seen corresponding path program 1 times [2025-03-08 00:55:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:34,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479790448] [2025-03-08 00:55:34,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:34,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:34,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 00:55:34,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 00:55:34,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:34,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:55:34,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479790448] [2025-03-08 00:55:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479790448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615279555] [2025-03-08 00:55:34,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:34,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:34,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:34,311 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:34,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:55:34,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 00:55:34,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 00:55:34,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:34,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:34,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:34,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:55:34,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615279555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:34,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 00:55:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076278902] [2025-03-08 00:55:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:34,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:34,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:34,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:34,522 INFO L87 Difference]: Start difference. First operand 160 states and 207 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:34,549 INFO L93 Difference]: Finished difference Result 198 states and 265 transitions. [2025-03-08 00:55:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:34,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-03-08 00:55:34,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:34,551 INFO L225 Difference]: With dead ends: 198 [2025-03-08 00:55:34,551 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 00:55:34,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:34,552 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:34,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 587 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 00:55:34,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2025-03-08 00:55:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.292857142857143) internal successors, (181), 142 states have internal predecessors, (181), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 209 transitions. [2025-03-08 00:55:34,562 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 209 transitions. Word has length 62 [2025-03-08 00:55:34,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:34,563 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 209 transitions. [2025-03-08 00:55:34,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 209 transitions. [2025-03-08 00:55:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 00:55:34,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:34,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:34,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:34,764 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-08 00:55:34,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:34,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:34,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1777112466, now seen corresponding path program 1 times [2025-03-08 00:55:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:34,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089822785] [2025-03-08 00:55:34,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:34,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:34,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 00:55:34,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 00:55:34,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:34,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:55:34,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089822785] [2025-03-08 00:55:34,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089822785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:34,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146644440] [2025-03-08 00:55:34,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:34,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:34,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:34,856 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:34,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:55:34,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 00:55:35,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 00:55:35,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:35,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:35,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:35,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:55:35,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:35,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146644440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:35,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:35,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 00:55:35,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136107122] [2025-03-08 00:55:35,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:35,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:35,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:35,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:35,058 INFO L87 Difference]: Start difference. First operand 162 states and 209 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:35,078 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2025-03-08 00:55:35,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:35,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-03-08 00:55:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:35,080 INFO L225 Difference]: With dead ends: 202 [2025-03-08 00:55:35,080 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 00:55:35,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:35,081 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:35,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 589 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:35,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 00:55:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-08 00:55:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 145 states have internal predecessors, (184), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2025-03-08 00:55:35,089 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 62 [2025-03-08 00:55:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:35,089 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2025-03-08 00:55:35,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2025-03-08 00:55:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 00:55:35,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:35,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:35,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:35,295 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-08 00:55:35,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:35,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1709681680, now seen corresponding path program 1 times [2025-03-08 00:55:35,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:35,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170121820] [2025-03-08 00:55:35,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:35,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 00:55:35,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 00:55:35,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:35,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:55:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170121820] [2025-03-08 00:55:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170121820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415844270] [2025-03-08 00:55:35,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:35,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:35,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:35,421 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:35,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:55:35,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 00:55:35,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 00:55:35,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:35,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:35,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:35,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:55:35,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415844270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:35,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762451354] [2025-03-08 00:55:35,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:35,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:35,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:35,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:35,636 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:35,647 INFO L93 Difference]: Finished difference Result 205 states and 271 transitions. [2025-03-08 00:55:35,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:35,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 62 [2025-03-08 00:55:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:35,648 INFO L225 Difference]: With dead ends: 205 [2025-03-08 00:55:35,648 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 00:55:35,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:35,649 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 37 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:35,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 398 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:35,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 00:55:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2025-03-08 00:55:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 179 states have internal predecessors, (236), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 264 transitions. [2025-03-08 00:55:35,656 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 264 transitions. Word has length 62 [2025-03-08 00:55:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:35,656 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 264 transitions. [2025-03-08 00:55:35,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 264 transitions. [2025-03-08 00:55:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 00:55:35,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:35,657 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:35,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:35,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:35,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:35,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:35,858 INFO L85 PathProgramCache]: Analyzing trace with hash -124453687, now seen corresponding path program 1 times [2025-03-08 00:55:35,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:35,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612131034] [2025-03-08 00:55:35,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:35,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:35,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 00:55:35,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 00:55:35,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:35,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:55:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612131034] [2025-03-08 00:55:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612131034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805880125] [2025-03-08 00:55:35,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:35,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:35,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:35,946 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:35,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:55:36,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 00:55:36,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 00:55:36,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:36,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:36,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:36,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:55:36,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:36,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805880125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:36,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:36,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 00:55:36,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183154959] [2025-03-08 00:55:36,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:36,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:36,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:36,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:36,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:36,167 INFO L87 Difference]: Start difference. First operand 199 states and 264 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:36,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:36,187 INFO L93 Difference]: Finished difference Result 280 states and 386 transitions. [2025-03-08 00:55:36,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:36,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-03-08 00:55:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:36,190 INFO L225 Difference]: With dead ends: 280 [2025-03-08 00:55:36,190 INFO L226 Difference]: Without dead ends: 205 [2025-03-08 00:55:36,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:36,191 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:36,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 589 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-08 00:55:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-08 00:55:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 183 states have (on average 1.3224043715846994) internal successors, (242), 185 states have internal predecessors, (242), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 270 transitions. [2025-03-08 00:55:36,198 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 270 transitions. Word has length 68 [2025-03-08 00:55:36,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:36,198 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 270 transitions. [2025-03-08 00:55:36,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 270 transitions. [2025-03-08 00:55:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 00:55:36,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:36,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:36,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:36,399 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,SelfDestructingSolverStorable8 [2025-03-08 00:55:36,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:36,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:36,400 INFO L85 PathProgramCache]: Analyzing trace with hash 72059818, now seen corresponding path program 1 times [2025-03-08 00:55:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:36,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365131461] [2025-03-08 00:55:36,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:36,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 00:55:36,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 00:55:36,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:36,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:55:36,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365131461] [2025-03-08 00:55:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365131461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786257728] [2025-03-08 00:55:36,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:36,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:36,483 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-08 00:55:36,484 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-08 00:55:36,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 00:55:36,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 00:55:36,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:36,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:36,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:36,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:36,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 00:55:36,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786257728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:36,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570796027] [2025-03-08 00:55:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:36,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:36,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:36,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:36,708 INFO L87 Difference]: Start difference. First operand 205 states and 270 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:36,717 INFO L93 Difference]: Finished difference Result 286 states and 388 transitions. [2025-03-08 00:55:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:36,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-03-08 00:55:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:36,719 INFO L225 Difference]: With dead ends: 286 [2025-03-08 00:55:36,719 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 00:55:36,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:36,720 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 31 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:36,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 399 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:36,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 00:55:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-08 00:55:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 259 states have (on average 1.3667953667953667) internal successors, (354), 261 states have internal predecessors, (354), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 382 transitions. [2025-03-08 00:55:36,727 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 382 transitions. Word has length 68 [2025-03-08 00:55:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:36,727 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 382 transitions. [2025-03-08 00:55:36,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 382 transitions. [2025-03-08 00:55:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 00:55:36,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:36,728 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:36,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:55:36,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:55:36,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:36,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:36,931 INFO L85 PathProgramCache]: Analyzing trace with hash 619558589, now seen corresponding path program 1 times [2025-03-08 00:55:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:36,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465502388] [2025-03-08 00:55:36,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:36,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 00:55:36,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 00:55:36,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:36,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:55:37,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:37,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465502388] [2025-03-08 00:55:37,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465502388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:37,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112692059] [2025-03-08 00:55:37,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:37,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:37,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:37,011 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-08 00:55:37,012 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-08 00:55:37,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 00:55:37,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 00:55:37,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:37,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:37,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:37,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 00:55:37,254 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:37,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112692059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:37,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:37,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956863570] [2025-03-08 00:55:37,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:37,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:37,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:37,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:37,255 INFO L87 Difference]: Start difference. First operand 281 states and 382 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:37,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:37,263 INFO L93 Difference]: Finished difference Result 438 states and 612 transitions. [2025-03-08 00:55:37,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:37,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 78 [2025-03-08 00:55:37,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:37,265 INFO L225 Difference]: With dead ends: 438 [2025-03-08 00:55:37,265 INFO L226 Difference]: Without dead ends: 433 [2025-03-08 00:55:37,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:37,266 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 27 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:37,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 398 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-08 00:55:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-03-08 00:55:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 411 states have (on average 1.4063260340632604) internal successors, (578), 413 states have internal predecessors, (578), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 606 transitions. [2025-03-08 00:55:37,274 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 606 transitions. Word has length 78 [2025-03-08 00:55:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:37,275 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 606 transitions. [2025-03-08 00:55:37,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 606 transitions. [2025-03-08 00:55:37,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 00:55:37,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:37,276 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:37,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:37,483 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,SelfDestructingSolverStorable10 [2025-03-08 00:55:37,484 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:37,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:37,484 INFO L85 PathProgramCache]: Analyzing trace with hash 931313699, now seen corresponding path program 1 times [2025-03-08 00:55:37,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:37,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231919766] [2025-03-08 00:55:37,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:37,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:37,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 00:55:37,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 00:55:37,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:37,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 00:55:37,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:37,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231919766] [2025-03-08 00:55:37,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231919766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:37,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227800952] [2025-03-08 00:55:37,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:37,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:37,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:37,573 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-08 00:55:37,574 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-08 00:55:37,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 00:55:37,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 00:55:37,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:37,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:37,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:37,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 00:55:37,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227800952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:37,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:37,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 00:55:37,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290115780] [2025-03-08 00:55:37,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:37,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:37,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:37,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:37,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:37,823 INFO L87 Difference]: Start difference. First operand 433 states and 606 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:37,841 INFO L93 Difference]: Finished difference Result 766 states and 1100 transitions. [2025-03-08 00:55:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-03-08 00:55:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:37,843 INFO L225 Difference]: With dead ends: 766 [2025-03-08 00:55:37,843 INFO L226 Difference]: Without dead ends: 457 [2025-03-08 00:55:37,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:55:37,844 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:37,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 589 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-08 00:55:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2025-03-08 00:55:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 435 states have (on average 1.3839080459770114) internal successors, (602), 437 states have internal predecessors, (602), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 630 transitions. [2025-03-08 00:55:37,852 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 630 transitions. Word has length 102 [2025-03-08 00:55:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:37,852 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 630 transitions. [2025-03-08 00:55:37,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 630 transitions. [2025-03-08 00:55:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 00:55:37,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:37,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:37,861 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-08 00:55:38,054 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,SelfDestructingSolverStorable11 [2025-03-08 00:55:38,054 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:38,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:38,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1018986556, now seen corresponding path program 1 times [2025-03-08 00:55:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:38,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659253510] [2025-03-08 00:55:38,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:38,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 00:55:38,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 00:55:38,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:38,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-08 00:55:38,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:38,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659253510] [2025-03-08 00:55:38,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659253510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:38,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86150380] [2025-03-08 00:55:38,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:38,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:38,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:38,146 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:38,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:55:38,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 00:55:38,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 00:55:38,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:38,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:38,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:38,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 00:55:38,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86150380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:38,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:38,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312785925] [2025-03-08 00:55:38,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:38,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:38,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:38,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:38,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:38,470 INFO L87 Difference]: Start difference. First operand 457 states and 630 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:38,485 INFO L93 Difference]: Finished difference Result 790 states and 1108 transitions. [2025-03-08 00:55:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:38,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-03-08 00:55:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:38,489 INFO L225 Difference]: With dead ends: 790 [2025-03-08 00:55:38,489 INFO L226 Difference]: Without dead ends: 785 [2025-03-08 00:55:38,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:38,491 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 16 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:38,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-03-08 00:55:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2025-03-08 00:55:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 763 states have (on average 1.4076015727391875) internal successors, (1074), 765 states have internal predecessors, (1074), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1102 transitions. [2025-03-08 00:55:38,507 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1102 transitions. Word has length 102 [2025-03-08 00:55:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:38,507 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1102 transitions. [2025-03-08 00:55:38,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1102 transitions. [2025-03-08 00:55:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 00:55:38,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:38,509 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:38,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 00:55:38,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:55:38,709 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:38,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:38,710 INFO L85 PathProgramCache]: Analyzing trace with hash -232029466, now seen corresponding path program 1 times [2025-03-08 00:55:38,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:38,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121395202] [2025-03-08 00:55:38,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:38,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 00:55:38,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 00:55:38,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:38,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 00:55:38,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:38,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121395202] [2025-03-08 00:55:38,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121395202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:38,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284002001] [2025-03-08 00:55:38,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:38,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:38,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:38,796 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:38,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:55:39,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 00:55:39,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 00:55:39,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:39,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:39,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 651 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:55:39,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-08 00:55:39,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:39,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284002001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:39,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:39,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:55:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894587554] [2025-03-08 00:55:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:39,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:55:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:39,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:55:39,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:39,070 INFO L87 Difference]: Start difference. First operand 785 states and 1102 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:39,081 INFO L93 Difference]: Finished difference Result 1134 states and 1612 transitions. [2025-03-08 00:55:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:55:39,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 132 [2025-03-08 00:55:39,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:39,084 INFO L225 Difference]: With dead ends: 1134 [2025-03-08 00:55:39,084 INFO L226 Difference]: Without dead ends: 801 [2025-03-08 00:55:39,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:39,085 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:39,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-08 00:55:39,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2025-03-08 00:55:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 779 states have (on average 1.399229781771502) internal successors, (1090), 781 states have internal predecessors, (1090), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1118 transitions. [2025-03-08 00:55:39,097 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1118 transitions. Word has length 132 [2025-03-08 00:55:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:39,098 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1118 transitions. [2025-03-08 00:55:39,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 00:55:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1118 transitions. [2025-03-08 00:55:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 00:55:39,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:39,099 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:39,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 00:55:39,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:55:39,300 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:39,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1698589639, now seen corresponding path program 1 times [2025-03-08 00:55:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:39,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833680801] [2025-03-08 00:55:39,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:39,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:39,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 00:55:39,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 00:55:39,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:39,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 00:55:39,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833680801] [2025-03-08 00:55:39,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833680801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656716601] [2025-03-08 00:55:39,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:39,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:39,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:39,404 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:39,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:55:39,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 00:55:39,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 00:55:39,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:39,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:39,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:39,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 00:55:39,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 00:55:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656716601] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:39,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:55:39,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:55:39,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964815683] [2025-03-08 00:55:39,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:39,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:55:39,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:39,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:55:39,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:55:39,732 INFO L87 Difference]: Start difference. First operand 801 states and 1118 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 1 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 00:55:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:39,751 INFO L93 Difference]: Finished difference Result 1601 states and 2237 transitions. [2025-03-08 00:55:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:55:39,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 1 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 132 [2025-03-08 00:55:39,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:39,753 INFO L225 Difference]: With dead ends: 1601 [2025-03-08 00:55:39,753 INFO L226 Difference]: Without dead ends: 804 [2025-03-08 00:55:39,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:55:39,754 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:39,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 597 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-08 00:55:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2025-03-08 00:55:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 782 states have (on average 1.39769820971867) internal successors, (1093), 784 states have internal predecessors, (1093), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:39,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1121 transitions. [2025-03-08 00:55:39,766 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1121 transitions. Word has length 132 [2025-03-08 00:55:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:39,766 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1121 transitions. [2025-03-08 00:55:39,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 1 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-08 00:55:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1121 transitions. [2025-03-08 00:55:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 00:55:39,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:39,768 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:39,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:39,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:39,969 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:39,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1556904485, now seen corresponding path program 2 times [2025-03-08 00:55:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:39,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991194527] [2025-03-08 00:55:39,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:55:39,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:40,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-03-08 00:55:40,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 00:55:40,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:55:40,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 00:55:40,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991194527] [2025-03-08 00:55:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991194527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385851216] [2025-03-08 00:55:40,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:55:40,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:40,116 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:40,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:55:40,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-03-08 00:55:40,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 00:55:40,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:55:40,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:40,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:55:40,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 00:55:40,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 00:55:40,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385851216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:40,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:55:40,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 13 [2025-03-08 00:55:40,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111718331] [2025-03-08 00:55:40,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:40,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:55:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:40,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:55:40,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:55:40,652 INFO L87 Difference]: Start difference. First operand 804 states and 1121 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:55:40,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:40,683 INFO L93 Difference]: Finished difference Result 1607 states and 2248 transitions. [2025-03-08 00:55:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:55:40,684 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 135 [2025-03-08 00:55:40,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:40,686 INFO L225 Difference]: With dead ends: 1607 [2025-03-08 00:55:40,686 INFO L226 Difference]: Without dead ends: 810 [2025-03-08 00:55:40,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:55:40,688 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:40,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1186 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-03-08 00:55:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 810. [2025-03-08 00:55:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 788 states have (on average 1.3946700507614214) internal successors, (1099), 790 states have internal predecessors, (1099), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 00:55:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1127 transitions. [2025-03-08 00:55:40,700 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1127 transitions. Word has length 135 [2025-03-08 00:55:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:40,700 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1127 transitions. [2025-03-08 00:55:40,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 00:55:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1127 transitions. [2025-03-08 00:55:40,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 00:55:40,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:40,702 INFO L218 NwaCegarLoop]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:40,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:40,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 00:55:40,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:40,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash 142351081, now seen corresponding path program 3 times [2025-03-08 00:55:40,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:40,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756353120] [2025-03-08 00:55:40,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:55:40,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:40,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 142 statements into 6 equivalence classes. [2025-03-08 00:55:40,987 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 57 of 142 statements. [2025-03-08 00:55:40,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:55:40,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 00:55:41,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:41,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756353120] [2025-03-08 00:55:41,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756353120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:41,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:41,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 00:55:41,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168325731] [2025-03-08 00:55:41,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:41,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:55:41,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:41,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:55:41,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:55:41,260 INFO L87 Difference]: Start difference. First operand 810 states and 1127 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:55:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:42,228 INFO L93 Difference]: Finished difference Result 1565 states and 2195 transitions. [2025-03-08 00:55:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:55:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 142 [2025-03-08 00:55:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:42,231 INFO L225 Difference]: With dead ends: 1565 [2025-03-08 00:55:42,231 INFO L226 Difference]: Without dead ends: 881 [2025-03-08 00:55:42,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:55:42,232 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 183 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:42,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 910 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 00:55:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-08 00:55:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 851. [2025-03-08 00:55:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 823 states have (on average 1.3876063183475091) internal successors, (1142), 827 states have internal predecessors, (1142), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 00:55:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1182 transitions. [2025-03-08 00:55:42,246 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1182 transitions. Word has length 142 [2025-03-08 00:55:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:42,246 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1182 transitions. [2025-03-08 00:55:42,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:55:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1182 transitions. [2025-03-08 00:55:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 00:55:42,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:42,248 INFO L218 NwaCegarLoop]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:42,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 00:55:42,248 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:42,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:42,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1268249460, now seen corresponding path program 1 times [2025-03-08 00:55:42,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:42,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564863801] [2025-03-08 00:55:42,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:42,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 00:55:42,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 00:55:42,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:42,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 00:55:42,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:42,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564863801] [2025-03-08 00:55:42,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564863801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:42,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806750577] [2025-03-08 00:55:42,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:42,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:42,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:42,392 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:42,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:55:42,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 00:55:42,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 00:55:42,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:42,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:42,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:55:42,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 00:55:42,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 00:55:42,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806750577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:42,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:55:42,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:55:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980800291] [2025-03-08 00:55:42,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:42,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:55:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:42,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:55:42,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:55:42,785 INFO L87 Difference]: Start difference. First operand 851 states and 1182 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:55:42,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:42,840 INFO L93 Difference]: Finished difference Result 1691 states and 2355 transitions. [2025-03-08 00:55:42,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:55:42,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 160 [2025-03-08 00:55:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:42,846 INFO L225 Difference]: With dead ends: 1691 [2025-03-08 00:55:42,847 INFO L226 Difference]: Without dead ends: 872 [2025-03-08 00:55:42,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:55:42,848 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 32 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:42,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 587 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-08 00:55:42,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2025-03-08 00:55:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 841 states have (on average 1.3828775267538644) internal successors, (1163), 845 states have internal predecessors, (1163), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-08 00:55:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1209 transitions. [2025-03-08 00:55:42,862 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1209 transitions. Word has length 160 [2025-03-08 00:55:42,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:42,862 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1209 transitions. [2025-03-08 00:55:42,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:55:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1209 transitions. [2025-03-08 00:55:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 00:55:42,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:42,864 INFO L218 NwaCegarLoop]: trace histogram [9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:42,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:43,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:55:43,065 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:43,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash -655467437, now seen corresponding path program 2 times [2025-03-08 00:55:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:43,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977733864] [2025-03-08 00:55:43,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:55:43,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:43,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-03-08 00:55:43,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 00:55:43,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:55:43,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 00:55:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977733864] [2025-03-08 00:55:43,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977733864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:43,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207174905] [2025-03-08 00:55:43,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:55:43,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:43,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:43,224 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:43,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:55:43,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-03-08 00:55:43,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 00:55:43,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:55:43,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:43,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:55:43,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-08 00:55:43,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 00:55:43,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207174905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:43,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:55:43,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 13 [2025-03-08 00:55:43,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28253361] [2025-03-08 00:55:43,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:43,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:55:43,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:43,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:55:43,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:55:43,949 INFO L87 Difference]: Start difference. First operand 872 states and 1209 transitions. Second operand has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:55:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:44,101 INFO L93 Difference]: Finished difference Result 1739 states and 2420 transitions. [2025-03-08 00:55:44,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:55:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 169 [2025-03-08 00:55:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:44,104 INFO L225 Difference]: With dead ends: 1739 [2025-03-08 00:55:44,104 INFO L226 Difference]: Without dead ends: 920 [2025-03-08 00:55:44,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:55:44,105 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 58 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:44,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1177 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:55:44,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-08 00:55:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 914. [2025-03-08 00:55:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 877 states have (on average 1.3740022805017105) internal successors, (1205), 881 states have internal predecessors, (1205), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 00:55:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1263 transitions. [2025-03-08 00:55:44,121 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1263 transitions. Word has length 169 [2025-03-08 00:55:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:44,121 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1263 transitions. [2025-03-08 00:55:44,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:55:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1263 transitions. [2025-03-08 00:55:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 00:55:44,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:44,123 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:44,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:55:44,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:44,324 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:44,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash 976241337, now seen corresponding path program 3 times [2025-03-08 00:55:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:44,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891664637] [2025-03-08 00:55:44,324 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:55:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:44,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 11 equivalence classes. [2025-03-08 00:55:44,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 75 of 187 statements. [2025-03-08 00:55:44,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:55:44,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-08 00:55:45,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:45,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891664637] [2025-03-08 00:55:45,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891664637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416826892] [2025-03-08 00:55:45,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:55:45,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:45,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:45,021 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:45,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:55:45,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 187 statements into 11 equivalence classes. [2025-03-08 00:55:45,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 75 of 187 statements. [2025-03-08 00:55:45,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:55:45,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:45,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:55:45,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:45,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 46 [2025-03-08 00:55:46,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:55:46,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 51 [2025-03-08 00:55:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-08 00:55:46,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:55:46,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416826892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:46,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:55:46,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2025-03-08 00:55:46,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325680179] [2025-03-08 00:55:46,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:46,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:55:46,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:46,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:55:46,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:55:46,454 INFO L87 Difference]: Start difference. First operand 914 states and 1263 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:55:47,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:47,748 INFO L93 Difference]: Finished difference Result 1774 states and 2465 transitions. [2025-03-08 00:55:47,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:55:47,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 187 [2025-03-08 00:55:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:47,753 INFO L225 Difference]: With dead ends: 1774 [2025-03-08 00:55:47,753 INFO L226 Difference]: Without dead ends: 1090 [2025-03-08 00:55:47,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:55:47,754 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 313 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:47,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 1165 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 00:55:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-03-08 00:55:47,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1045. [2025-03-08 00:55:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 985 states have (on average 1.3614213197969542) internal successors, (1341), 1003 states have internal predecessors, (1341), 51 states have call successors, (51), 8 states have call predecessors, (51), 8 states have return successors, (51), 37 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 00:55:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1443 transitions. [2025-03-08 00:55:47,779 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1443 transitions. Word has length 187 [2025-03-08 00:55:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:47,779 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1443 transitions. [2025-03-08 00:55:47,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 00:55:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1443 transitions. [2025-03-08 00:55:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-08 00:55:47,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:47,782 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:47,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:47,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:47,982 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:47,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1465469266, now seen corresponding path program 1 times [2025-03-08 00:55:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323475230] [2025-03-08 00:55:47,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:48,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 00:55:48,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 00:55:48,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:48,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 00:55:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323475230] [2025-03-08 00:55:48,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323475230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596785414] [2025-03-08 00:55:48,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:48,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:48,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:48,301 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:48,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:55:48,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-08 00:55:48,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-08 00:55:48,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:48,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:48,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:55:48,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2025-03-08 00:55:48,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-08 00:55:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596785414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:48,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:55:48,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2025-03-08 00:55:48,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731320277] [2025-03-08 00:55:48,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:48,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:55:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:48,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:55:48,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:55:48,822 INFO L87 Difference]: Start difference. First operand 1045 states and 1443 transitions. Second operand has 14 states, 14 states have (on average 12.357142857142858) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 00:55:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:49,326 INFO L93 Difference]: Finished difference Result 4015 states and 5639 transitions. [2025-03-08 00:55:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:55:49,326 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.357142857142858) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 209 [2025-03-08 00:55:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:49,335 INFO L225 Difference]: With dead ends: 4015 [2025-03-08 00:55:49,335 INFO L226 Difference]: Without dead ends: 3124 [2025-03-08 00:55:49,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:55:49,338 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 239 mSDsluCounter, 1895 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:49,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 2123 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:55:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2025-03-08 00:55:49,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 1297. [2025-03-08 00:55:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1229 states have (on average 1.3482506102522376) internal successors, (1657), 1251 states have internal predecessors, (1657), 59 states have call successors, (59), 8 states have call predecessors, (59), 8 states have return successors, (59), 41 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 00:55:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1775 transitions. [2025-03-08 00:55:49,383 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1775 transitions. Word has length 209 [2025-03-08 00:55:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:49,386 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1775 transitions. [2025-03-08 00:55:49,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.357142857142858) internal successors, (173), 14 states have internal predecessors, (173), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 00:55:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1775 transitions. [2025-03-08 00:55:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-08 00:55:49,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:49,390 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:49,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:49,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:49,591 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:49,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash -66174161, now seen corresponding path program 1 times [2025-03-08 00:55:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442875917] [2025-03-08 00:55:49,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:49,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 00:55:49,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 00:55:49,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:49,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-08 00:55:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:49,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442875917] [2025-03-08 00:55:49,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442875917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:49,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:49,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:55:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137263712] [2025-03-08 00:55:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:49,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:49,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:49,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:55:49,807 INFO L87 Difference]: Start difference. First operand 1297 states and 1775 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:49,829 INFO L93 Difference]: Finished difference Result 2214 states and 3061 transitions. [2025-03-08 00:55:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:49,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 221 [2025-03-08 00:55:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:49,832 INFO L225 Difference]: With dead ends: 2214 [2025-03-08 00:55:49,832 INFO L226 Difference]: Without dead ends: 1329 [2025-03-08 00:55:49,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:55:49,834 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:49,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 587 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-03-08 00:55:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2025-03-08 00:55:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1261 states have (on average 1.339413164155432) internal successors, (1689), 1283 states have internal predecessors, (1689), 59 states have call successors, (59), 8 states have call predecessors, (59), 8 states have return successors, (59), 41 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 00:55:49,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1807 transitions. [2025-03-08 00:55:49,859 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1807 transitions. Word has length 221 [2025-03-08 00:55:49,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:49,859 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1807 transitions. [2025-03-08 00:55:49,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1807 transitions. [2025-03-08 00:55:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-08 00:55:49,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:49,862 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:49,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 00:55:49,862 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:49,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1415120175, now seen corresponding path program 1 times [2025-03-08 00:55:49,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:49,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436418211] [2025-03-08 00:55:49,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:49,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 00:55:49,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 00:55:49,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:49,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 48 proven. 1 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 00:55:50,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:50,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436418211] [2025-03-08 00:55:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436418211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:50,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316781989] [2025-03-08 00:55:50,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:50,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:50,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:50,178 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:50,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:55:50,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 00:55:50,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 00:55:50,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:50,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:50,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:55:50,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2025-03-08 00:55:50,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-08 00:55:50,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316781989] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:50,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:55:50,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2025-03-08 00:55:50,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948158119] [2025-03-08 00:55:50,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:50,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:55:50,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:50,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:55:50,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:55:50,771 INFO L87 Difference]: Start difference. First operand 1329 states and 1807 transitions. Second operand has 17 states, 17 states have (on average 11.823529411764707) internal successors, (201), 17 states have internal predecessors, (201), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 00:55:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:51,296 INFO L93 Difference]: Finished difference Result 4256 states and 5826 transitions. [2025-03-08 00:55:51,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:55:51,297 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.823529411764707) internal successors, (201), 17 states have internal predecessors, (201), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 221 [2025-03-08 00:55:51,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:51,303 INFO L225 Difference]: With dead ends: 4256 [2025-03-08 00:55:51,304 INFO L226 Difference]: Without dead ends: 3125 [2025-03-08 00:55:51,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 429 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:55:51,306 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 199 mSDsluCounter, 2141 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:51,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 2371 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:55:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2025-03-08 00:55:51,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 1634. [2025-03-08 00:55:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1560 states have (on average 1.3294871794871794) internal successors, (2074), 1585 states have internal predecessors, (2074), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 44 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 00:55:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2204 transitions. [2025-03-08 00:55:51,340 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2204 transitions. Word has length 221 [2025-03-08 00:55:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:51,341 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2204 transitions. [2025-03-08 00:55:51,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.823529411764707) internal successors, (201), 17 states have internal predecessors, (201), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 00:55:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2204 transitions. [2025-03-08 00:55:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 00:55:51,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:51,344 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:51,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:51,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 00:55:51,544 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash 905410825, now seen corresponding path program 1 times [2025-03-08 00:55:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:51,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125240688] [2025-03-08 00:55:51,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:51,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:51,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 00:55:51,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 00:55:51,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:51,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2025-03-08 00:55:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125240688] [2025-03-08 00:55:51,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125240688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:51,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:51,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:55:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824759590] [2025-03-08 00:55:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:51,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:51,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:51,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:55:51,771 INFO L87 Difference]: Start difference. First operand 1634 states and 2204 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:51,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:51,806 INFO L93 Difference]: Finished difference Result 2871 states and 3890 transitions. [2025-03-08 00:55:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:51,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 230 [2025-03-08 00:55:51,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:51,811 INFO L225 Difference]: With dead ends: 2871 [2025-03-08 00:55:51,811 INFO L226 Difference]: Without dead ends: 1682 [2025-03-08 00:55:51,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:55:51,812 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:51,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 587 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2025-03-08 00:55:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1666. [2025-03-08 00:55:51,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1592 states have (on average 1.3228643216080402) internal successors, (2106), 1617 states have internal predecessors, (2106), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 44 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 00:55:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2236 transitions. [2025-03-08 00:55:51,844 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2236 transitions. Word has length 230 [2025-03-08 00:55:51,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:51,844 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2236 transitions. [2025-03-08 00:55:51,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:51,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2236 transitions. [2025-03-08 00:55:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 00:55:51,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:51,847 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:51,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 00:55:51,847 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:51,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:51,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1006322792, now seen corresponding path program 1 times [2025-03-08 00:55:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:51,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073950583] [2025-03-08 00:55:51,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:51,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:51,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 00:55:51,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 00:55:51,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:51,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2025-03-08 00:55:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073950583] [2025-03-08 00:55:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073950583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:51,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:51,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:55:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222752995] [2025-03-08 00:55:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:51,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:51,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:51,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:55:51,999 INFO L87 Difference]: Start difference. First operand 1666 states and 2236 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:52,024 INFO L93 Difference]: Finished difference Result 2919 states and 3938 transitions. [2025-03-08 00:55:52,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:52,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 230 [2025-03-08 00:55:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:52,029 INFO L225 Difference]: With dead ends: 2919 [2025-03-08 00:55:52,029 INFO L226 Difference]: Without dead ends: 1698 [2025-03-08 00:55:52,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:55:52,031 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 1 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:52,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 589 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2025-03-08 00:55:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1698. [2025-03-08 00:55:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1624 states have (on average 1.3165024630541873) internal successors, (2138), 1649 states have internal predecessors, (2138), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 44 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 00:55:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2268 transitions. [2025-03-08 00:55:52,069 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2268 transitions. Word has length 230 [2025-03-08 00:55:52,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:52,069 INFO L471 AbstractCegarLoop]: Abstraction has 1698 states and 2268 transitions. [2025-03-08 00:55:52,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2268 transitions. [2025-03-08 00:55:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 00:55:52,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:52,074 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:52,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 00:55:52,074 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:52,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1886062294, now seen corresponding path program 2 times [2025-03-08 00:55:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:52,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550767247] [2025-03-08 00:55:52,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:55:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:52,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 230 statements into 2 equivalence classes. [2025-03-08 00:55:52,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 00:55:52,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:55:52,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2025-03-08 00:55:52,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:52,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550767247] [2025-03-08 00:55:52,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550767247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:52,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:52,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:55:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769241754] [2025-03-08 00:55:52,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:52,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:55:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:52,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:55:52,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:55:52,358 INFO L87 Difference]: Start difference. First operand 1698 states and 2268 transitions. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:52,537 INFO L93 Difference]: Finished difference Result 3063 states and 4066 transitions. [2025-03-08 00:55:52,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:55:52,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 230 [2025-03-08 00:55:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:52,544 INFO L225 Difference]: With dead ends: 3063 [2025-03-08 00:55:52,544 INFO L226 Difference]: Without dead ends: 1810 [2025-03-08 00:55:52,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08 00:55:52,547 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 31 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:52,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 760 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:55:52,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2025-03-08 00:55:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1698. [2025-03-08 00:55:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1624 states have (on average 1.3066502463054188) internal successors, (2122), 1649 states have internal predecessors, (2122), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 44 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 00:55:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2252 transitions. [2025-03-08 00:55:52,589 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2252 transitions. Word has length 230 [2025-03-08 00:55:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:52,589 INFO L471 AbstractCegarLoop]: Abstraction has 1698 states and 2252 transitions. [2025-03-08 00:55:52,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2252 transitions. [2025-03-08 00:55:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 00:55:52,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:52,593 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:52,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 00:55:52,595 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:52,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash 64237961, now seen corresponding path program 1 times [2025-03-08 00:55:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:52,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146939749] [2025-03-08 00:55:52,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:52,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 00:55:52,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 00:55:52,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:52,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-08 00:55:52,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:52,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146939749] [2025-03-08 00:55:52,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146939749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:52,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:52,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:55:52,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051940807] [2025-03-08 00:55:52,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:52,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:55:52,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:52,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:55:52,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:55:52,756 INFO L87 Difference]: Start difference. First operand 1698 states and 2252 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:52,784 INFO L93 Difference]: Finished difference Result 2999 states and 3986 transitions. [2025-03-08 00:55:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:55:52,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 230 [2025-03-08 00:55:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:52,789 INFO L225 Difference]: With dead ends: 2999 [2025-03-08 00:55:52,789 INFO L226 Difference]: Without dead ends: 1746 [2025-03-08 00:55:52,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:55:52,791 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:52,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 592 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:55:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2025-03-08 00:55:52,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1730. [2025-03-08 00:55:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1656 states have (on average 1.291062801932367) internal successors, (2138), 1681 states have internal predecessors, (2138), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 44 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 00:55:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2268 transitions. [2025-03-08 00:55:52,822 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2268 transitions. Word has length 230 [2025-03-08 00:55:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:52,822 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2268 transitions. [2025-03-08 00:55:52,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2268 transitions. [2025-03-08 00:55:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 00:55:52,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:52,826 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:52,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 00:55:52,827 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:52,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:52,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1089729960, now seen corresponding path program 1 times [2025-03-08 00:55:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:52,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039423411] [2025-03-08 00:55:52,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:52,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 00:55:52,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 00:55:52,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:52,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-08 00:55:53,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:53,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039423411] [2025-03-08 00:55:53,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039423411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:53,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131788156] [2025-03-08 00:55:53,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:53,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:53,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:53,038 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:53,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:55:53,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 00:55:53,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 00:55:53,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:53,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:53,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:55:53,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-08 00:55:53,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-08 00:55:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131788156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:53,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:55:53,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-08 00:55:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102846329] [2025-03-08 00:55:53,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:53,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:55:53,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:53,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:55:53,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:55:53,712 INFO L87 Difference]: Start difference. First operand 1730 states and 2268 transitions. Second operand has 12 states, 12 states have (on average 21.0) internal successors, (252), 12 states have internal predecessors, (252), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:54,010 INFO L93 Difference]: Finished difference Result 9446 states and 12389 transitions. [2025-03-08 00:55:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:55:54,011 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 21.0) internal successors, (252), 12 states have internal predecessors, (252), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 230 [2025-03-08 00:55:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:54,036 INFO L225 Difference]: With dead ends: 9446 [2025-03-08 00:55:54,036 INFO L226 Difference]: Without dead ends: 9441 [2025-03-08 00:55:54,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:55:54,039 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 388 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:54,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 708 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:55:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9441 states. [2025-03-08 00:55:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9441 to 7635. [2025-03-08 00:55:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7635 states, 7561 states have (on average 1.3133183441343736) internal successors, (9930), 7586 states have internal predecessors, (9930), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 44 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 00:55:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7635 states to 7635 states and 10060 transitions. [2025-03-08 00:55:54,145 INFO L78 Accepts]: Start accepts. Automaton has 7635 states and 10060 transitions. Word has length 230 [2025-03-08 00:55:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:54,146 INFO L471 AbstractCegarLoop]: Abstraction has 7635 states and 10060 transitions. [2025-03-08 00:55:54,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.0) internal successors, (252), 12 states have internal predecessors, (252), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 7635 states and 10060 transitions. [2025-03-08 00:55:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-08 00:55:54,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:54,156 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:54,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 00:55:54,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 00:55:54,357 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:54,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1272461113, now seen corresponding path program 2 times [2025-03-08 00:55:54,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:54,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403881359] [2025-03-08 00:55:54,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:55:54,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:54,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 280 statements into 2 equivalence classes. [2025-03-08 00:55:54,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 00:55:54,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:55:54,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 199 proven. 28 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-03-08 00:55:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403881359] [2025-03-08 00:55:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403881359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103121578] [2025-03-08 00:55:54,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:55:54,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:54,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:54,575 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:54,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:55:55,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 280 statements into 2 equivalence classes. [2025-03-08 00:55:55,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 280 of 280 statements. [2025-03-08 00:55:55,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:55:55,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:55,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:55:55,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 208 proven. 19 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-03-08 00:55:55,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 208 proven. 19 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-03-08 00:55:55,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103121578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:55,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:55:55,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 00:55:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356799724] [2025-03-08 00:55:55,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:55,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:55:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:55,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:55:55,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:55:55,462 INFO L87 Difference]: Start difference. First operand 7635 states and 10060 transitions. Second operand has 8 states, 8 states have (on average 26.25) internal successors, (210), 8 states have internal predecessors, (210), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:55,648 INFO L93 Difference]: Finished difference Result 14071 states and 18539 transitions. [2025-03-08 00:55:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:55:55,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.25) internal successors, (210), 8 states have internal predecessors, (210), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 280 [2025-03-08 00:55:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:55,668 INFO L225 Difference]: With dead ends: 14071 [2025-03-08 00:55:55,668 INFO L226 Difference]: Without dead ends: 11131 [2025-03-08 00:55:55,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 556 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:55:55,674 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 179 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:55,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1308 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:55:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11131 states. [2025-03-08 00:55:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11131 to 7544. [2025-03-08 00:55:55,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7544 states, 7470 states have (on average 1.3049531459170014) internal successors, (9748), 7495 states have internal predecessors, (9748), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 44 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 00:55:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7544 states to 7544 states and 9878 transitions. [2025-03-08 00:55:55,784 INFO L78 Accepts]: Start accepts. Automaton has 7544 states and 9878 transitions. Word has length 280 [2025-03-08 00:55:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:55,784 INFO L471 AbstractCegarLoop]: Abstraction has 7544 states and 9878 transitions. [2025-03-08 00:55:55,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.25) internal successors, (210), 8 states have internal predecessors, (210), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 7544 states and 9878 transitions. [2025-03-08 00:55:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-08 00:55:55,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:55,797 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:55,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 00:55:55,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 00:55:55,998 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:55,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1429097788, now seen corresponding path program 3 times [2025-03-08 00:55:55,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596545699] [2025-03-08 00:55:55,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:55:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:56,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 310 statements into 11 equivalence classes. [2025-03-08 00:55:56,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 81 of 310 statements. [2025-03-08 00:55:56,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:55:56,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 853 trivial. 0 not checked. [2025-03-08 00:55:56,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:56,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596545699] [2025-03-08 00:55:56,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596545699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:55:56,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:55:56,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 00:55:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184744944] [2025-03-08 00:55:56,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:55:56,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:55:56,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:56,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:55:56,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:55:56,765 INFO L87 Difference]: Start difference. First operand 7544 states and 9878 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:57,729 INFO L93 Difference]: Finished difference Result 14748 states and 19311 transitions. [2025-03-08 00:55:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:55:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 310 [2025-03-08 00:55:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:57,740 INFO L225 Difference]: With dead ends: 14748 [2025-03-08 00:55:57,740 INFO L226 Difference]: Without dead ends: 7642 [2025-03-08 00:55:57,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:55:57,747 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 122 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:57,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1266 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 00:55:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7642 states. [2025-03-08 00:55:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7642 to 7613. [2025-03-08 00:55:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7613 states, 7532 states have (on average 1.3045671800318641) internal successors, (9826), 7557 states have internal predecessors, (9826), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 51 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 00:55:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7613 states to 7613 states and 9970 transitions. [2025-03-08 00:55:57,847 INFO L78 Accepts]: Start accepts. Automaton has 7613 states and 9970 transitions. Word has length 310 [2025-03-08 00:55:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:57,848 INFO L471 AbstractCegarLoop]: Abstraction has 7613 states and 9970 transitions. [2025-03-08 00:55:57,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:55:57,848 INFO L276 IsEmpty]: Start isEmpty. Operand 7613 states and 9970 transitions. [2025-03-08 00:55:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-08 00:55:57,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:57,858 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:57,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 00:55:57,858 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:57,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1076199490, now seen corresponding path program 1 times [2025-03-08 00:55:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787791] [2025-03-08 00:55:57,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:57,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:57,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 00:55:57,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 00:55:57,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:57,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 392 proven. 16 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-08 00:55:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:55:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787791] [2025-03-08 00:55:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:55:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854818309] [2025-03-08 00:55:58,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:55:58,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:58,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:55:58,202 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:55:58,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:55:58,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-08 00:55:58,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-08 00:55:58,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:55:58,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:55:58,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:55:58,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:55:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 384 proven. 57 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-08 00:55:58,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:55:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 384 proven. 57 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-08 00:55:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854818309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:55:58,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:55:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2025-03-08 00:55:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595575635] [2025-03-08 00:55:58,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:55:58,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:55:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:55:58,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:55:58,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:55:58,978 INFO L87 Difference]: Start difference. First operand 7613 states and 9970 transitions. Second operand has 13 states, 13 states have (on average 24.846153846153847) internal successors, (323), 13 states have internal predecessors, (323), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:55:59,355 INFO L93 Difference]: Finished difference Result 13140 states and 17199 transitions. [2025-03-08 00:55:59,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:55:59,356 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 24.846153846153847) internal successors, (323), 13 states have internal predecessors, (323), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 311 [2025-03-08 00:55:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:55:59,371 INFO L225 Difference]: With dead ends: 13140 [2025-03-08 00:55:59,371 INFO L226 Difference]: Without dead ends: 10234 [2025-03-08 00:55:59,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 620 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=212, Invalid=388, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:55:59,377 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 265 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:55:59,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1709 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:55:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10234 states. [2025-03-08 00:55:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10234 to 7567. [2025-03-08 00:55:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7567 states, 7486 states have (on average 1.3002938819129042) internal successors, (9734), 7511 states have internal predecessors, (9734), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 51 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 00:55:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7567 states to 7567 states and 9878 transitions. [2025-03-08 00:55:59,494 INFO L78 Accepts]: Start accepts. Automaton has 7567 states and 9878 transitions. Word has length 311 [2025-03-08 00:55:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:55:59,495 INFO L471 AbstractCegarLoop]: Abstraction has 7567 states and 9878 transitions. [2025-03-08 00:55:59,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.846153846153847) internal successors, (323), 13 states have internal predecessors, (323), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:55:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7567 states and 9878 transitions. [2025-03-08 00:55:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-08 00:55:59,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:55:59,505 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:55:59,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-08 00:55:59,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:55:59,706 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:55:59,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:55:59,706 INFO L85 PathProgramCache]: Analyzing trace with hash -807283228, now seen corresponding path program 2 times [2025-03-08 00:55:59,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:55:59,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086008587] [2025-03-08 00:55:59,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:55:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:55:59,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 351 statements into 2 equivalence classes. [2025-03-08 00:55:59,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 351 of 351 statements. [2025-03-08 00:55:59,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:55:59,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-03-08 00:56:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:00,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086008587] [2025-03-08 00:56:00,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086008587] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:00,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922230097] [2025-03-08 00:56:00,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:56:00,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:00,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:00,030 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:00,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 00:56:00,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 351 statements into 2 equivalence classes. [2025-03-08 00:56:00,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 351 of 351 statements. [2025-03-08 00:56:00,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:56:00,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:00,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:56:00,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-03-08 00:56:00,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:56:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 288 proven. 23 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-03-08 00:56:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922230097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:56:00,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:56:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 00:56:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525586914] [2025-03-08 00:56:00,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:56:00,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:56:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:00,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:56:00,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:56:00,872 INFO L87 Difference]: Start difference. First operand 7567 states and 9878 transitions. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:01,047 INFO L93 Difference]: Finished difference Result 13643 states and 17819 transitions. [2025-03-08 00:56:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:56:01,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 351 [2025-03-08 00:56:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:01,060 INFO L225 Difference]: With dead ends: 13643 [2025-03-08 00:56:01,060 INFO L226 Difference]: Without dead ends: 10877 [2025-03-08 00:56:01,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 698 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:56:01,067 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 100 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:01,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 931 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:56:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10877 states. [2025-03-08 00:56:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10877 to 7483. [2025-03-08 00:56:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7483 states, 7402 states have (on average 1.2923534179951364) internal successors, (9566), 7427 states have internal predecessors, (9566), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 51 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 00:56:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7483 states to 7483 states and 9710 transitions. [2025-03-08 00:56:01,165 INFO L78 Accepts]: Start accepts. Automaton has 7483 states and 9710 transitions. Word has length 351 [2025-03-08 00:56:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:01,166 INFO L471 AbstractCegarLoop]: Abstraction has 7483 states and 9710 transitions. [2025-03-08 00:56:01,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:56:01,166 INFO L276 IsEmpty]: Start isEmpty. Operand 7483 states and 9710 transitions. [2025-03-08 00:56:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-08 00:56:01,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:01,175 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:56:01,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-08 00:56:01,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:01,376 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:01,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1834280282, now seen corresponding path program 1 times [2025-03-08 00:56:01,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:01,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496626820] [2025-03-08 00:56:01,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:01,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:01,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-08 00:56:01,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-08 00:56:01,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:01,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2025-03-08 00:56:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496626820] [2025-03-08 00:56:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496626820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161214599] [2025-03-08 00:56:03,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:03,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:03,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:03,407 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:03,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 00:56:03,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-08 00:56:04,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-08 00:56:04,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:04,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:04,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 00:56:04,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:04,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:56:04,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 283 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 143 [2025-03-08 00:56:04,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:56:04,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 163 treesize of output 57 [2025-03-08 00:56:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2025-03-08 00:56:04,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:04,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161214599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:04,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:04,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2025-03-08 00:56:04,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900791967] [2025-03-08 00:56:04,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:04,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:56:04,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:04,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:56:04,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:56:04,570 INFO L87 Difference]: Start difference. First operand 7483 states and 9710 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:56:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:05,038 INFO L93 Difference]: Finished difference Result 14828 states and 19221 transitions. [2025-03-08 00:56:05,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:56:05,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 381 [2025-03-08 00:56:05,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:05,050 INFO L225 Difference]: With dead ends: 14828 [2025-03-08 00:56:05,051 INFO L226 Difference]: Without dead ends: 7476 [2025-03-08 00:56:05,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-08 00:56:05,059 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 46 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:05,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 717 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:56:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7476 states. [2025-03-08 00:56:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7476 to 7449. [2025-03-08 00:56:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7449 states, 7376 states have (on average 1.2918926247288502) internal successors, (9529), 7393 states have internal predecessors, (9529), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 51 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 00:56:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7449 states to 7449 states and 9657 transitions. [2025-03-08 00:56:05,148 INFO L78 Accepts]: Start accepts. Automaton has 7449 states and 9657 transitions. Word has length 381 [2025-03-08 00:56:05,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:05,149 INFO L471 AbstractCegarLoop]: Abstraction has 7449 states and 9657 transitions. [2025-03-08 00:56:05,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 5 states have internal predecessors, (117), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:56:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7449 states and 9657 transitions. [2025-03-08 00:56:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-08 00:56:05,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:05,213 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:56:05,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-08 00:56:05,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 00:56:05,414 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:05,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash -116288917, now seen corresponding path program 1 times [2025-03-08 00:56:05,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573701630] [2025-03-08 00:56:05,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:05,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-08 00:56:05,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-08 00:56:05,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:05,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 1082 trivial. 0 not checked. [2025-03-08 00:56:07,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:07,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573701630] [2025-03-08 00:56:07,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573701630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:07,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798541355] [2025-03-08 00:56:07,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:07,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:07,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:07,571 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:07,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 00:56:08,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-08 00:56:08,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-08 00:56:08,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:08,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:08,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 1621 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:56:08,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:08,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:56:08,410 INFO L224 Elim1Store]: Index analysis took 146 ms [2025-03-08 00:56:08,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 280 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 100 [2025-03-08 00:56:08,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:56:08,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 120 treesize of output 42 [2025-03-08 00:56:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 41 proven. 2 refuted. 0 times theorem prover too weak. 1066 trivial. 0 not checked. [2025-03-08 00:56:08,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:56:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2025-03-08 00:56:10,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798541355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:56:10,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:56:10,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 22 [2025-03-08 00:56:10,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879221600] [2025-03-08 00:56:10,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:56:10,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:56:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:10,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:56:10,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:56:10,827 INFO L87 Difference]: Start difference. First operand 7449 states and 9657 transitions. Second operand has 22 states, 22 states have (on average 9.0) internal successors, (198), 20 states have internal predecessors, (198), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 10 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-08 00:56:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:13,875 INFO L93 Difference]: Finished difference Result 15160 states and 19647 transitions. [2025-03-08 00:56:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:56:13,876 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.0) internal successors, (198), 20 states have internal predecessors, (198), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 10 states have call predecessors, (17), 7 states have call successors, (17) Word has length 389 [2025-03-08 00:56:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:13,884 INFO L225 Difference]: With dead ends: 15160 [2025-03-08 00:56:13,885 INFO L226 Difference]: Without dead ends: 7850 [2025-03-08 00:56:13,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 775 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1451, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:56:13,893 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 393 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:13,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 2113 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 00:56:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7850 states. [2025-03-08 00:56:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7850 to 7666. [2025-03-08 00:56:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7666 states, 7566 states have (on average 1.2907745175786414) internal successors, (9766), 7591 states have internal predecessors, (9766), 91 states have call successors, (91), 8 states have call predecessors, (91), 8 states have return successors, (91), 74 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-08 00:56:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7666 states to 7666 states and 9948 transitions. [2025-03-08 00:56:14,017 INFO L78 Accepts]: Start accepts. Automaton has 7666 states and 9948 transitions. Word has length 389 [2025-03-08 00:56:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:14,017 INFO L471 AbstractCegarLoop]: Abstraction has 7666 states and 9948 transitions. [2025-03-08 00:56:14,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.0) internal successors, (198), 20 states have internal predecessors, (198), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 10 states have call predecessors, (17), 7 states have call successors, (17) [2025-03-08 00:56:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 7666 states and 9948 transitions. [2025-03-08 00:56:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2025-03-08 00:56:14,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:14,025 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:56:14,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-08 00:56:14,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-08 00:56:14,226 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:14,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash -153352621, now seen corresponding path program 1 times [2025-03-08 00:56:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:14,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27609778] [2025-03-08 00:56:14,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:14,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-08 00:56:14,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-08 00:56:14,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:14,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 5 proven. 52 refuted. 0 times theorem prover too weak. 1079 trivial. 0 not checked. [2025-03-08 00:56:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27609778] [2025-03-08 00:56:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27609778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091412137] [2025-03-08 00:56:16,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:16,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:16,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:16,955 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:16,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 00:56:17,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 417 statements into 1 equivalence classes. [2025-03-08 00:56:17,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 417 of 417 statements. [2025-03-08 00:56:17,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:17,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:17,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:56:17,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:17,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:56:17,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:56:17,795 INFO L224 Elim1Store]: Index analysis took 109 ms [2025-03-08 00:56:17,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 281 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 64 [2025-03-08 00:56:17,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:56:17,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 33 [2025-03-08 00:56:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2025-03-08 00:56:17,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:56:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091412137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:56:17,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:56:17,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2025-03-08 00:56:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071114097] [2025-03-08 00:56:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:56:17,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:56:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:17,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:56:17,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:56:17,958 INFO L87 Difference]: Start difference. First operand 7666 states and 9948 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 00:56:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:18,241 INFO L93 Difference]: Finished difference Result 15261 states and 19799 transitions. [2025-03-08 00:56:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:56:18,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 417 [2025-03-08 00:56:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:18,250 INFO L225 Difference]: With dead ends: 15261 [2025-03-08 00:56:18,250 INFO L226 Difference]: Without dead ends: 7629 [2025-03-08 00:56:18,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:56:18,258 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 10 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:18,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 730 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:56:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7629 states. [2025-03-08 00:56:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7629 to 7629. [2025-03-08 00:56:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7629 states, 7538 states have (on average 1.2905279915096843) internal successors, (9728), 7554 states have internal predecessors, (9728), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 74 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-08 00:56:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 9892 transitions. [2025-03-08 00:56:18,365 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 9892 transitions. Word has length 417 [2025-03-08 00:56:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:18,365 INFO L471 AbstractCegarLoop]: Abstraction has 7629 states and 9892 transitions. [2025-03-08 00:56:18,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 00:56:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 9892 transitions. [2025-03-08 00:56:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-03-08 00:56:18,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:18,375 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:56:18,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-08 00:56:18,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-08 00:56:18,576 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:18,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1828579618, now seen corresponding path program 1 times [2025-03-08 00:56:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:18,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81064665] [2025-03-08 00:56:18,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:18,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:18,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-08 00:56:18,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-08 00:56:18,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:18,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 5 proven. 52 refuted. 0 times theorem prover too weak. 1087 trivial. 0 not checked. [2025-03-08 00:56:20,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81064665] [2025-03-08 00:56:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81064665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477224117] [2025-03-08 00:56:20,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:20,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:20,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:20,913 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:20,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-08 00:56:21,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-03-08 00:56:21,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-03-08 00:56:21,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:21,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:21,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 2080 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:56:21,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:21,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:56:21,782 INFO L224 Elim1Store]: Index analysis took 135 ms [2025-03-08 00:56:21,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 280 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 46 [2025-03-08 00:56:21,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:56:21,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 66 treesize of output 24 [2025-03-08 00:56:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2025-03-08 00:56:21,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:56:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 1102 trivial. 0 not checked. [2025-03-08 00:56:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477224117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:56:24,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:56:24,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 20 [2025-03-08 00:56:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310356730] [2025-03-08 00:56:24,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:56:24,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:56:24,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:56:24,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:56:24,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:56:24,101 INFO L87 Difference]: Start difference. First operand 7629 states and 9892 transitions. Second operand has 20 states, 20 states have (on average 11.35) internal successors, (227), 18 states have internal predecessors, (227), 8 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) [2025-03-08 00:56:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:56:25,463 INFO L93 Difference]: Finished difference Result 15751 states and 20442 transitions. [2025-03-08 00:56:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:56:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.35) internal successors, (227), 18 states have internal predecessors, (227), 8 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) Word has length 425 [2025-03-08 00:56:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:56:25,471 INFO L225 Difference]: With dead ends: 15751 [2025-03-08 00:56:25,471 INFO L226 Difference]: Without dead ends: 8161 [2025-03-08 00:56:25,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:56:25,476 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 254 mSDsluCounter, 2283 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 2458 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:56:25,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 2458 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 00:56:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8161 states. [2025-03-08 00:56:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8161 to 7973. [2025-03-08 00:56:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7973 states, 7842 states have (on average 1.2913797500637592) internal successors, (10127), 7874 states have internal predecessors, (10127), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 106 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-08 00:56:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 10371 transitions. [2025-03-08 00:56:25,583 INFO L78 Accepts]: Start accepts. Automaton has 7973 states and 10371 transitions. Word has length 425 [2025-03-08 00:56:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:56:25,584 INFO L471 AbstractCegarLoop]: Abstraction has 7973 states and 10371 transitions. [2025-03-08 00:56:25,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.35) internal successors, (227), 18 states have internal predecessors, (227), 8 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (23), 11 states have call predecessors, (23), 8 states have call successors, (23) [2025-03-08 00:56:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 7973 states and 10371 transitions. [2025-03-08 00:56:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 00:56:25,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:56:25,595 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:56:25,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-08 00:56:25,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:25,795 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:56:25,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:56:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1695135424, now seen corresponding path program 1 times [2025-03-08 00:56:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:56:25,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826532419] [2025-03-08 00:56:25,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:56:25,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 00:56:25,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 00:56:25,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:25,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1167 trivial. 0 not checked. [2025-03-08 00:56:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:56:27,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826532419] [2025-03-08 00:56:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826532419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:56:27,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113968206] [2025-03-08 00:56:27,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:56:27,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:56:27,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:56:27,205 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:56:27,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-08 00:56:27,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 00:56:28,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 00:56:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:56:28,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:56:28,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 2375 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 00:56:28,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:56:28,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 28 [2025-03-08 00:56:28,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:56:28,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 37 [2025-03-08 00:56:28,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:56:28,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2025-03-08 00:56:28,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:56:28,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 37 [2025-03-08 00:56:28,716 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 55 treesize of output 7 [2025-03-08 00:56:28,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1181 backedges. 16 proven. 21 refuted. 0 times theorem prover too weak. 1144 trivial. 0 not checked. [2025-03-08 00:56:28,740 INFO L312 TraceCheckSpWp]: Computing backward predicates...